Submission #22460

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
22460	2017-04-30T04:52:28 Z	이대회 트래쉬 대회에야옹(#967, dofwk1526, HUIDONG, mincl)	Fully Generate (KRIII5_FG)	C++14	2 / 7	9 ms	6360 KB

FG

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <functional>
#include <map>
#include <set>
#include <string>

using namespace std;

int N, K, T;
int con[1111111] = { 0, 1, 2, 2, 3, 3 };
int idx = 6;

int main()
{
	cin >> N;
	int i = 4;
	while (idx <= N)
	{
		int val = con[i];
		for (int j = 0; j < val; j++)
		{
			con[idx++] = i;
			if (idx > N)
				break;
		}
		i++;
	}

	long long mult = 1;
	for (int i = 1; i <= N; i++)
		mult = (mult * con[i]) % 1000000007;

	cout << mult % 1000000007;
}

Subtask #1

2.0 / 2.0

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

Subtask #2

0 / 5.0

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