Submission #16551083

Source Code Expand

#include <cstdio>

#include <queue>

const int N = 1e5 + 1e4;

int k;
bool vis[N];

struct node { int cur, val; };

int main() {
	scanf( "%d", &k );
	std::deque<node> q;
	q.push_front( (node){ 1, 1 } );
	while( !q.empty() ) {
		node top = q.front(); q.pop_front();
		if( vis[ top.cur ] )
			continue;
		vis[ top.cur ] = true;
		if( top.cur == 0 ) {
			printf( "%d\n", top.val );
			return  0;
		}
		q.push_front((node){ ( top.cur * 10 ) % k, top.val });
		q.push_back((node){ ( top.cur + 1 ) % k, top.val + 1 });
	}
}

Submission Info

Submission Time
Task D - Small Multiple
User Woshiluo
Language C++ (GCC 9.2.1)
Score 700
Code Size 546 Byte
Status AC
Exec Time 10 ms
Memory 3692 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:13:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   13 |  scanf( "%d", &k );
      |  ~~~~~^~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 3
AC × 67
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 6 ms 3192 KiB
02.txt AC 2 ms 3200 KiB
03.txt AC 2 ms 3172 KiB
04.txt AC 2 ms 3116 KiB
05.txt AC 2 ms 3208 KiB
06.txt AC 2 ms 3180 KiB
07.txt AC 2 ms 3168 KiB
08.txt AC 1 ms 3204 KiB
09.txt AC 2 ms 3088 KiB
10.txt AC 2 ms 3168 KiB
11.txt AC 2 ms 3116 KiB
12.txt AC 2 ms 3176 KiB
13.txt AC 3 ms 3120 KiB
14.txt AC 2 ms 3116 KiB
15.txt AC 2 ms 3120 KiB
16.txt AC 1 ms 3212 KiB
17.txt AC 3 ms 3200 KiB
18.txt AC 2 ms 3104 KiB
19.txt AC 2 ms 3200 KiB
20.txt AC 2 ms 3164 KiB
21.txt AC 2 ms 3072 KiB
22.txt AC 7 ms 3240 KiB
23.txt AC 9 ms 3692 KiB
24.txt AC 9 ms 3628 KiB
25.txt AC 9 ms 3524 KiB
26.txt AC 7 ms 3468 KiB
27.txt AC 5 ms 3616 KiB
28.txt AC 5 ms 3532 KiB
29.txt AC 4 ms 3520 KiB
30.txt AC 6 ms 3584 KiB
31.txt AC 2 ms 3068 KiB
32.txt AC 2 ms 3088 KiB
33.txt AC 10 ms 3584 KiB
34.txt AC 5 ms 3380 KiB
35.txt AC 4 ms 3408 KiB
36.txt AC 2 ms 3384 KiB
37.txt AC 3 ms 3324 KiB
38.txt AC 2 ms 3248 KiB
39.txt AC 3 ms 3392 KiB
40.txt AC 2 ms 3132 KiB
41.txt AC 8 ms 3420 KiB
42.txt AC 6 ms 3348 KiB
43.txt AC 2 ms 3276 KiB
44.txt AC 2 ms 3220 KiB
45.txt AC 10 ms 3412 KiB
46.txt AC 5 ms 3432 KiB
47.txt AC 2 ms 3100 KiB
48.txt AC 5 ms 3408 KiB
49.txt AC 9 ms 3484 KiB
50.txt AC 4 ms 3372 KiB
51.txt AC 2 ms 3292 KiB
52.txt AC 4 ms 3360 KiB
53.txt AC 5 ms 3316 KiB
54.txt AC 3 ms 3308 KiB
55.txt AC 3 ms 3260 KiB
56.txt AC 4 ms 3372 KiB
57.txt AC 6 ms 3380 KiB
58.txt AC 3 ms 3304 KiB
59.txt AC 3 ms 3384 KiB
60.txt AC 5 ms 3200 KiB
61.txt AC 2 ms 3120 KiB
62.txt AC 3 ms 3236 KiB
63.txt AC 7 ms 3264 KiB
64.txt AC 6 ms 3316 KiB
s1.txt AC 2 ms 3096 KiB
s2.txt AC 2 ms 3088 KiB
s3.txt AC 5 ms 3296 KiB