| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | |
| 7 | 8 | 9 | 10 | 11 | 12 | 13 |
| 14 | 15 | 16 | 17 | 18 | 19 | 20 |
| 21 | 22 | 23 | 24 | 25 | 26 | 27 |
| 28 | 29 | 30 |
Tags
- Multi Task Learning Objectives for Natural Language Processing 리뷰
- MMTOD
- BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 리뷰
- TOD 논문리뷰
- Attention Is All You Need
- 다양한 모듈에서 log쓰기
- UBAR: Towards Fully End-to-End Task-Oriented Dialog System with GPT-2
- BART 논문리뷰
- Attention Is All You Need 리뷰
- NLP 논문 리뷰
- Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer
- 정책기반 agent
- BERT란
- Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer 리뷰
- Evaluate Multiwoz
- BERT 사용방법
- Multi Task Learning Objectives for Natural Language Processing
- A Neural Attention Model for Abstractive Sentence Summarization
- CNN 논문리뷰
- ImageNet Classification with Deep ConvolutionalNeural Networks 리뷰
- T5 논문 리뷰
- Zero-shot Generalization in Dialog State Tracking through GenerativeQuestion Answering
- BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 논문리뷰
- attention 설명
- 바닥부터 배우는 강화 학습
- RuntimeError: DataLoader worker (pid(s) ) exited unexpectedly
- 뉴텝스 400
- 길찾기
- hugging face tokenizer에서 special case 추가하기
- The Natural Language Decathlon:Multitask Learning as Question Answering
Archives
- Today
- Total
one by one ◼◻◼◻
백준 1697번 숨바꼭질 본문
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
|
import sys
from collections import deque
line = sys.stdin.readline().split()
N, K =int(line[0]),int(line[1])
move = deque()
move.append(N)
visit = [0] * (100000+1)
while move:
loc= move.popleft()
if loc == K:
print(visit[loc])
break
else:
for nx in (loc-1, loc+1, loc*2):
if 0<=nx<=100000 and not visit[nx]:
visit[nx]=visit[loc] +1
move.append(nx)
|
cs |
'코딩문제' 카테고리의 다른 글
| 백준 2667 단지번호 붙이기 (0) | 2022.06.16 |
|---|---|
| 백준 2178 , 미로탐색 (0) | 2022.06.16 |
| 백준 1009, 분산처리 (0) | 2022.06.16 |
| 정수 삼각형 (코딩테스트 연습동적계획법(Dynamic Programming)) (0) | 2022.06.10 |
| 베스트 앨범(코딩테스트 연습-해시) (0) | 2022.06.10 |
'코딩문제' Related Articles
more
Comments