#include <iostream>
#include <cstdio>
using namespace std;
int dat[1000005], n;
long long ans = 4;
int main()
{
cin >> n;
if (n == 1)
{
cout << 1;
}
else if (n == 2)
{
cout << 2;
}
else if (n == 3)
{
cout << 4;
}
else {
dat[1] = 1;
dat[2] = 2;
dat[3] = 2;
int gen_num = 3, left_cnt = dat[3];
int i = 4;
while (i <= n)
{
if (left_cnt > 0)
{
dat[i] = gen_num;
ans = (ans * (dat[i] % 1000000007)) % 1000000007;
left_cnt--;
i++;
}
else
{
left_cnt = dat[++gen_num];
}
}
cout << ans;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
5924 KB |
Output is correct |
2 |
Correct |
0 ms |
5924 KB |
Output is correct |
3 |
Correct |
0 ms |
5924 KB |
Output is correct |
4 |
Correct |
0 ms |
5924 KB |
Output is correct |
5 |
Correct |
0 ms |
5924 KB |
Output is correct |
6 |
Correct |
0 ms |
5924 KB |
Output is correct |
7 |
Correct |
0 ms |
5924 KB |
Output is correct |
8 |
Correct |
0 ms |
5924 KB |
Output is correct |
9 |
Correct |
0 ms |
5924 KB |
Output is correct |
10 |
Correct |
0 ms |
5924 KB |
Output is correct |
11 |
Correct |
0 ms |
5924 KB |
Output is correct |
12 |
Correct |
6 ms |
5924 KB |
Output is correct |
13 |
Correct |
3 ms |
5924 KB |
Output is correct |
14 |
Correct |
0 ms |
5924 KB |
Output is correct |
15 |
Correct |
6 ms |
5924 KB |
Output is correct |
16 |
Correct |
3 ms |
5924 KB |
Output is correct |
17 |
Correct |
0 ms |
5924 KB |
Output is correct |
18 |
Correct |
3 ms |
5924 KB |
Output is correct |
19 |
Correct |
0 ms |
5924 KB |
Output is correct |
20 |
Correct |
0 ms |
5924 KB |
Output is correct |
21 |
Correct |
3 ms |
5924 KB |
Output is correct |
22 |
Correct |
3 ms |
5924 KB |
Output is correct |
23 |
Correct |
0 ms |
5924 KB |
Output is correct |
24 |
Correct |
6 ms |
5924 KB |
Output is correct |
25 |
Correct |
0 ms |
5924 KB |
Output is correct |
26 |
Correct |
0 ms |
5924 KB |
Output is correct |
27 |
Correct |
6 ms |
5924 KB |
Output is correct |
28 |
Correct |
0 ms |
5924 KB |
Output is correct |
29 |
Correct |
3 ms |
5924 KB |
Output is correct |
30 |
Correct |
3 ms |
5924 KB |
Output is correct |
31 |
Correct |
3 ms |
5924 KB |
Output is correct |
32 |
Correct |
0 ms |
5924 KB |
Output is correct |
33 |
Correct |
6 ms |
5924 KB |
Output is correct |
34 |
Correct |
0 ms |
5924 KB |
Output is correct |
35 |
Correct |
9 ms |
5924 KB |
Output is correct |
36 |
Correct |
0 ms |
5924 KB |
Output is correct |
37 |
Correct |
0 ms |
5924 KB |
Output is correct |
38 |
Correct |
3 ms |
5924 KB |
Output is correct |
39 |
Correct |
6 ms |
5924 KB |
Output is correct |
40 |
Correct |
3 ms |
5924 KB |
Output is correct |
41 |
Correct |
0 ms |
5924 KB |
Output is correct |
42 |
Correct |
3 ms |
5924 KB |
Output is correct |
43 |
Correct |
0 ms |
5924 KB |
Output is correct |
44 |
Correct |
6 ms |
5924 KB |
Output is correct |
45 |
Correct |
0 ms |
5924 KB |
Output is correct |
46 |
Correct |
6 ms |
5924 KB |
Output is correct |
47 |
Correct |
3 ms |
5924 KB |
Output is correct |
48 |
Correct |
6 ms |
5924 KB |
Output is correct |
49 |
Correct |
3 ms |
5924 KB |
Output is correct |
50 |
Correct |
6 ms |
5924 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
5924 KB |
Output is correct |
2 |
Correct |
0 ms |
5924 KB |
Output is correct |
3 |
Correct |
0 ms |
5924 KB |
Output is correct |
4 |
Correct |
0 ms |
5924 KB |
Output is correct |
5 |
Correct |
0 ms |
5924 KB |
Output is correct |
6 |
Correct |
0 ms |
5924 KB |
Output is correct |
7 |
Correct |
0 ms |
5924 KB |
Output is correct |
8 |
Correct |
0 ms |
5924 KB |
Output is correct |
9 |
Correct |
0 ms |
5924 KB |
Output is correct |
10 |
Correct |
0 ms |
5924 KB |
Output is correct |
11 |
Correct |
0 ms |
5924 KB |
Output is correct |
12 |
Correct |
6 ms |
5924 KB |
Output is correct |
13 |
Correct |
3 ms |
5924 KB |
Output is correct |
14 |
Correct |
0 ms |
5924 KB |
Output is correct |
15 |
Correct |
6 ms |
5924 KB |
Output is correct |
16 |
Correct |
3 ms |
5924 KB |
Output is correct |
17 |
Correct |
0 ms |
5924 KB |
Output is correct |
18 |
Correct |
3 ms |
5924 KB |
Output is correct |
19 |
Correct |
0 ms |
5924 KB |
Output is correct |
20 |
Correct |
0 ms |
5924 KB |
Output is correct |
21 |
Correct |
3 ms |
5924 KB |
Output is correct |
22 |
Correct |
3 ms |
5924 KB |
Output is correct |
23 |
Correct |
0 ms |
5924 KB |
Output is correct |
24 |
Correct |
6 ms |
5924 KB |
Output is correct |
25 |
Correct |
0 ms |
5924 KB |
Output is correct |
26 |
Correct |
0 ms |
5924 KB |
Output is correct |
27 |
Correct |
6 ms |
5924 KB |
Output is correct |
28 |
Correct |
0 ms |
5924 KB |
Output is correct |
29 |
Correct |
3 ms |
5924 KB |
Output is correct |
30 |
Correct |
3 ms |
5924 KB |
Output is correct |
31 |
Correct |
3 ms |
5924 KB |
Output is correct |
32 |
Correct |
0 ms |
5924 KB |
Output is correct |
33 |
Correct |
6 ms |
5924 KB |
Output is correct |
34 |
Correct |
0 ms |
5924 KB |
Output is correct |
35 |
Correct |
9 ms |
5924 KB |
Output is correct |
36 |
Correct |
0 ms |
5924 KB |
Output is correct |
37 |
Correct |
0 ms |
5924 KB |
Output is correct |
38 |
Correct |
3 ms |
5924 KB |
Output is correct |
39 |
Correct |
6 ms |
5924 KB |
Output is correct |
40 |
Correct |
3 ms |
5924 KB |
Output is correct |
41 |
Correct |
0 ms |
5924 KB |
Output is correct |
42 |
Correct |
3 ms |
5924 KB |
Output is correct |
43 |
Correct |
0 ms |
5924 KB |
Output is correct |
44 |
Correct |
6 ms |
5924 KB |
Output is correct |
45 |
Correct |
0 ms |
5924 KB |
Output is correct |
46 |
Correct |
6 ms |
5924 KB |
Output is correct |
47 |
Correct |
3 ms |
5924 KB |
Output is correct |
48 |
Correct |
6 ms |
5924 KB |
Output is correct |
49 |
Correct |
3 ms |
5924 KB |
Output is correct |
50 |
Correct |
6 ms |
5924 KB |
Output is correct |
51 |
Runtime error |
3 ms |
5924 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
52 |
Halted |
0 ms |
0 KB |
- |