일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- UBAR: Towards Fully End-to-End Task-Oriented Dialog System with GPT-2
- 바닥부터 배우는 강화 학습
- BERT 사용방법
- Evaluate Multiwoz
- 길찾기
- Attention Is All You Need
- Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer
- RuntimeError: DataLoader worker (pid(s) ) exited unexpectedly
- hugging face tokenizer에서 special case 추가하기
- 정책기반 agent
- ImageNet Classification with Deep ConvolutionalNeural Networks 리뷰
- attention 설명
- A Neural Attention Model for Abstractive Sentence Summarization
- BART 논문리뷰
- 다양한 모듈에서 log쓰기
- NLP 논문 리뷰
- BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 논문리뷰
- CNN 논문리뷰
- Attention Is All You Need 리뷰
- Zero-shot Generalization in Dialog State Tracking through GenerativeQuestion Answering
- 뉴텝스 400
- Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer 리뷰
- MMTOD
- Multi Task Learning Objectives for Natural Language Processing 리뷰
- The Natural Language Decathlon:Multitask Learning as Question Answering
- TOD 논문리뷰
- T5 논문 리뷰
- Multi Task Learning Objectives for Natural Language Processing
- BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 리뷰
- BERT란
- Today
- Total
목록2022/06/16 (4)
one by one ◼◻◼◻
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
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 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 # 단지 번호붙이기 import sys from collections import deque dx = [-1,1,0,0] dy = [0,0,-1,1] N = int(sys.stdin.readline().split()[0]) x,y = N,N data = [[0] * y for _ in range(x)] visit = [[0] * y for _ in range(x)] for i in range(x): line = list(sys.stdin.readline().sp..
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 import sys from collections import deque dx = [-1,1,0,0] dy = [0,0,-1,1] x, y = (map(int, sys.stdin.readline().split())) data = [[0] * y for _ in range(x)] visit = [[0] * y for _ in range(x)] for i in range(x): line = list(sys.stdin.readline().split()[0]) for j, temp in enumerate(line): data[i][j] = int(temp) togo =..
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 import sys N = int(sys.stdin.readline()) for _ in range(N): items = list(map(int, sys.stdin.readline().split())) a,b = items[0]%10, items[1] temp = a last_part = [a] if a == 0: print(10) continue while True: temp*= a if len(last_part)!=1 and temp%10 == a: break else: last_part.append(temp%10) loop_len = len(last_part) print(last_part[b%..