Submission #3730349
Source Code Expand
from collections import deque K=int(input()) Graph1=[0 for i in range(K)] Graph0=[0 for i in range(K)] Graph1[K-1]=0 for i in range(K-2): Graph1[i+1]=i+2 for i in range(1,K): Graph0[i]=(10*i)%K l=1 q=deque([(1,1)]) Visited=[0]*K while q: x,d=q.popleft() if x==0: ans=d break if Visited[x]==1: continue Visited[x]=1 if Visited[Graph0[x]]==0: q.appendleft((Graph0[x],d)) if Visited[Graph1[x]]==0: q.append((Graph1[x],d+1)) print(ans)
Submission Info
Submission Time | |
---|---|
Task | D - Small Multiple |
User | Chanyuh |
Language | PyPy3 (2.4.0) |
Score | 700 |
Code Size | 523 Byte |
Status | AC |
Exec Time | 222 ms |
Memory | 46004 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 60.txt, 61.txt, 62.txt, 63.txt, 64.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 169 ms | 38256 KB |
02.txt | AC | 171 ms | 38256 KB |
03.txt | AC | 169 ms | 38384 KB |
04.txt | AC | 173 ms | 38256 KB |
05.txt | AC | 168 ms | 38256 KB |
06.txt | AC | 169 ms | 38384 KB |
07.txt | AC | 172 ms | 38256 KB |
08.txt | AC | 167 ms | 38256 KB |
09.txt | AC | 170 ms | 38256 KB |
10.txt | AC | 171 ms | 38256 KB |
11.txt | AC | 179 ms | 38384 KB |
12.txt | AC | 176 ms | 38256 KB |
13.txt | AC | 190 ms | 38256 KB |
14.txt | AC | 178 ms | 38256 KB |
15.txt | AC | 180 ms | 38256 KB |
16.txt | AC | 174 ms | 38256 KB |
17.txt | AC | 175 ms | 38256 KB |
18.txt | AC | 174 ms | 38256 KB |
19.txt | AC | 172 ms | 38256 KB |
20.txt | AC | 172 ms | 38256 KB |
21.txt | AC | 190 ms | 45748 KB |
22.txt | AC | 222 ms | 45876 KB |
23.txt | AC | 207 ms | 45876 KB |
24.txt | AC | 213 ms | 45876 KB |
25.txt | AC | 212 ms | 45876 KB |
26.txt | AC | 206 ms | 45876 KB |
27.txt | AC | 211 ms | 45876 KB |
28.txt | AC | 212 ms | 45876 KB |
29.txt | AC | 204 ms | 45876 KB |
30.txt | AC | 208 ms | 45876 KB |
31.txt | AC | 172 ms | 38256 KB |
32.txt | AC | 171 ms | 38256 KB |
33.txt | AC | 196 ms | 44160 KB |
34.txt | AC | 193 ms | 41456 KB |
35.txt | AC | 201 ms | 43576 KB |
36.txt | AC | 198 ms | 45876 KB |
37.txt | AC | 187 ms | 40688 KB |
38.txt | AC | 191 ms | 41072 KB |
39.txt | AC | 191 ms | 42352 KB |
40.txt | AC | 182 ms | 39664 KB |
41.txt | AC | 198 ms | 45056 KB |
42.txt | AC | 202 ms | 46004 KB |
43.txt | AC | 192 ms | 40560 KB |
44.txt | AC | 188 ms | 40048 KB |
45.txt | AC | 204 ms | 43376 KB |
46.txt | AC | 209 ms | 43056 KB |
47.txt | AC | 185 ms | 40048 KB |
48.txt | AC | 207 ms | 45056 KB |
49.txt | AC | 212 ms | 45056 KB |
50.txt | AC | 199 ms | 42864 KB |
51.txt | AC | 192 ms | 41200 KB |
52.txt | AC | 198 ms | 42224 KB |
53.txt | AC | 201 ms | 43960 KB |
54.txt | AC | 197 ms | 42608 KB |
55.txt | AC | 204 ms | 42608 KB |
56.txt | AC | 207 ms | 43960 KB |
57.txt | AC | 211 ms | 45876 KB |
58.txt | AC | 200 ms | 43184 KB |
59.txt | AC | 201 ms | 45056 KB |
60.txt | AC | 200 ms | 43576 KB |
61.txt | AC | 193 ms | 40560 KB |
62.txt | AC | 195 ms | 42096 KB |
63.txt | AC | 202 ms | 45876 KB |
64.txt | AC | 211 ms | 45876 KB |
s1.txt | AC | 172 ms | 38448 KB |
s2.txt | AC | 171 ms | 38256 KB |
s3.txt | AC | 209 ms | 44672 KB |