| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- Attention Is All You Need
- Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer 리뷰
- 정책기반 agent
- Multi Task Learning Objectives for Natural Language Processing
- Attention Is All You Need 리뷰
- RuntimeError: DataLoader worker (pid(s) ) exited unexpectedly
- attention 설명
- T5 논문 리뷰
- CNN 논문리뷰
- Zero-shot Generalization in Dialog State Tracking through GenerativeQuestion Answering
- 바닥부터 배우는 강화 학습
- Multi Task Learning Objectives for Natural Language Processing 리뷰
- BART 논문리뷰
- UBAR: Towards Fully End-to-End Task-Oriented Dialog System with GPT-2
- The Natural Language Decathlon:Multitask Learning as Question Answering
- 길찾기
- NLP 논문 리뷰
- hugging face tokenizer에서 special case 추가하기
- Evaluate Multiwoz
- BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 논문리뷰
- ImageNet Classification with Deep ConvolutionalNeural Networks 리뷰
- 다양한 모듈에서 log쓰기
- Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer
- BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 리뷰
- TOD 논문리뷰
- MMTOD
- 뉴텝스 400
- BERT 사용방법
- A Neural Attention Model for Abstractive Sentence Summarization
- BERT란
Archives
- Today
- Total
목록그래프 (1)
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
코딩문제
2022. 6. 16. 16:42