Submission #22625

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
22625	2017-04-30T05:59:41 Z	JAESu_gak(#945, gs13031, lg970325, tsfo1489)	Fully Generate (KRIII5_FG)	C++14	2 / 7	9 ms	8928 KB

FG

#include<stdio.h>
long long int n, garr[1000005], ans = 1;
int main()
{
	int i, j, k;
	scanf("%lld", &n);
	garr[1] = 1;
	garr[2] = 2;
	garr[3] = 2;
	k = 3;
	for (i = 3; i <= n; i++)
	{
		for (j = 1; j <= garr[i]; j++)
		{
			garr[++k] = i;
			if (k == n) break;
		}
		if (j != garr[i] + 1) break;
	}
	for (i = 1; i <= n; i++) ans = (ans*garr[i]) % 1000000007;
	printf("%lld", ans);
}

Compilation message

FG.cpp: In function 'int main()':
FG.cpp:6:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
                   ^

Subtask #1

2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	8928 KB	Output is correct
2	Correct	0 ms	8928 KB	Output is correct
3	Correct	0 ms	8928 KB	Output is correct
4	Correct	0 ms	8928 KB	Output is correct
5	Correct	0 ms	8928 KB	Output is correct
6	Correct	0 ms	8928 KB	Output is correct
7	Correct	0 ms	8928 KB	Output is correct
8	Correct	0 ms	8928 KB	Output is correct
9	Correct	0 ms	8928 KB	Output is correct
10	Correct	0 ms	8928 KB	Output is correct
11	Correct	0 ms	8928 KB	Output is correct
12	Correct	9 ms	8928 KB	Output is correct
13	Correct	6 ms	8928 KB	Output is correct
14	Correct	0 ms	8928 KB	Output is correct
15	Correct	6 ms	8928 KB	Output is correct
16	Correct	3 ms	8928 KB	Output is correct
17	Correct	3 ms	8928 KB	Output is correct
18	Correct	6 ms	8928 KB	Output is correct
19	Correct	0 ms	8928 KB	Output is correct
20	Correct	3 ms	8928 KB	Output is correct
21	Correct	6 ms	8928 KB	Output is correct
22	Correct	3 ms	8928 KB	Output is correct
23	Correct	0 ms	8928 KB	Output is correct
24	Correct	3 ms	8928 KB	Output is correct
25	Correct	3 ms	8928 KB	Output is correct
26	Correct	0 ms	8928 KB	Output is correct
27	Correct	6 ms	8928 KB	Output is correct
28	Correct	0 ms	8928 KB	Output is correct
29	Correct	6 ms	8928 KB	Output is correct
30	Correct	3 ms	8928 KB	Output is correct
31	Correct	3 ms	8928 KB	Output is correct
32	Correct	0 ms	8928 KB	Output is correct
33	Correct	9 ms	8928 KB	Output is correct
34	Correct	3 ms	8928 KB	Output is correct
35	Correct	9 ms	8928 KB	Output is correct
36	Correct	3 ms	8928 KB	Output is correct
37	Correct	0 ms	8928 KB	Output is correct
38	Correct	3 ms	8928 KB	Output is correct
39	Correct	9 ms	8928 KB	Output is correct
40	Correct	3 ms	8928 KB	Output is correct
41	Correct	0 ms	8928 KB	Output is correct
42	Correct	3 ms	8928 KB	Output is correct
43	Correct	0 ms	8928 KB	Output is correct
44	Correct	3 ms	8928 KB	Output is correct
45	Correct	0 ms	8928 KB	Output is correct
46	Correct	6 ms	8928 KB	Output is correct
47	Correct	3 ms	8928 KB	Output is correct
48	Correct	6 ms	8928 KB	Output is correct
49	Correct	6 ms	8928 KB	Output is correct
50	Correct	9 ms	8928 KB	Output is correct

Subtask #2

0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	8928 KB	Output is correct
2	Correct	0 ms	8928 KB	Output is correct
3	Correct	0 ms	8928 KB	Output is correct
4	Correct	0 ms	8928 KB	Output is correct
5	Correct	0 ms	8928 KB	Output is correct
6	Correct	0 ms	8928 KB	Output is correct
7	Correct	0 ms	8928 KB	Output is correct
8	Correct	0 ms	8928 KB	Output is correct
9	Correct	0 ms	8928 KB	Output is correct
10	Correct	0 ms	8928 KB	Output is correct
11	Correct	0 ms	8928 KB	Output is correct
12	Correct	9 ms	8928 KB	Output is correct
13	Correct	6 ms	8928 KB	Output is correct
14	Correct	0 ms	8928 KB	Output is correct
15	Correct	6 ms	8928 KB	Output is correct
16	Correct	3 ms	8928 KB	Output is correct
17	Correct	3 ms	8928 KB	Output is correct
18	Correct	6 ms	8928 KB	Output is correct
19	Correct	0 ms	8928 KB	Output is correct
20	Correct	3 ms	8928 KB	Output is correct
21	Correct	6 ms	8928 KB	Output is correct
22	Correct	3 ms	8928 KB	Output is correct
23	Correct	0 ms	8928 KB	Output is correct
24	Correct	3 ms	8928 KB	Output is correct
25	Correct	3 ms	8928 KB	Output is correct
26	Correct	0 ms	8928 KB	Output is correct
27	Correct	6 ms	8928 KB	Output is correct
28	Correct	0 ms	8928 KB	Output is correct
29	Correct	6 ms	8928 KB	Output is correct
30	Correct	3 ms	8928 KB	Output is correct
31	Correct	3 ms	8928 KB	Output is correct
32	Correct	0 ms	8928 KB	Output is correct
33	Correct	9 ms	8928 KB	Output is correct
34	Correct	3 ms	8928 KB	Output is correct
35	Correct	9 ms	8928 KB	Output is correct
36	Correct	3 ms	8928 KB	Output is correct
37	Correct	0 ms	8928 KB	Output is correct
38	Correct	3 ms	8928 KB	Output is correct
39	Correct	9 ms	8928 KB	Output is correct
40	Correct	3 ms	8928 KB	Output is correct
41	Correct	0 ms	8928 KB	Output is correct
42	Correct	3 ms	8928 KB	Output is correct
43	Correct	0 ms	8928 KB	Output is correct
44	Correct	3 ms	8928 KB	Output is correct
45	Correct	0 ms	8928 KB	Output is correct
46	Correct	6 ms	8928 KB	Output is correct
47	Correct	3 ms	8928 KB	Output is correct
48	Correct	6 ms	8928 KB	Output is correct
49	Correct	6 ms	8928 KB	Output is correct
50	Correct	9 ms	8928 KB	Output is correct
51	Runtime error	0 ms	8928 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
52	Halted	0 ms	0 KB	-