Submission #22547

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
22547	2017-04-30T05:28:11 Z	추억의 skyseasoft(#940, junodeveloper, solarmagic)	Fully Generate (KRIII5_FG)	C++	2 / 7	500 ms	251116 KB

#include<stdio.h>
#define M ((ll)1e9 + 7)
typedef long long ll;
ll n,a[32000000];
ll f(ll a, ll b) {
    if(!b) return 1;
    if(b & 1) return f(a,b-1) * a % M;
    ll k = f(a, b>>1);
    return k*k%M;
}
int main() {
    scanf("%lld",&n);
    if(n <= 4) {
        ll r[5] = {0,1,2,4,12};
        printf("%lld", r[n]);
    } else {
        a[1] = 1, a[2] = 2, a[3] = 2;
        ll res = 4, i=3, s=3;
        for(ll j=4;s+a[i]<n;i++) {
            for(ll k=0;j<32000000 && k<a[i];k++) a[j++] = i;
            res = (res * f(i,a[i])) % M;
            s += a[i];
        }
        res = (res * f(i, n-s)) % M;
        printf("%lld", res);
    }
    return 0;
}

Compilation message

FG.cpp: In function 'int main()':
FG.cpp:12:21: 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	251116 KB	Output is correct
2	Correct	0 ms	251116 KB	Output is correct
3	Correct	0 ms	251116 KB	Output is correct
4	Correct	0 ms	251116 KB	Output is correct
5	Correct	0 ms	251116 KB	Output is correct
6	Correct	0 ms	251116 KB	Output is correct
7	Correct	0 ms	251116 KB	Output is correct
8	Correct	0 ms	251116 KB	Output is correct
9	Correct	0 ms	251116 KB	Output is correct
10	Correct	0 ms	251116 KB	Output is correct
11	Correct	0 ms	251116 KB	Output is correct
12	Correct	0 ms	251116 KB	Output is correct
13	Correct	0 ms	251116 KB	Output is correct
14	Correct	0 ms	251116 KB	Output is correct
15	Correct	3 ms	251116 KB	Output is correct
16	Correct	0 ms	251116 KB	Output is correct
17	Correct	0 ms	251116 KB	Output is correct
18	Correct	0 ms	251116 KB	Output is correct
19	Correct	0 ms	251116 KB	Output is correct
20	Correct	0 ms	251116 KB	Output is correct
21	Correct	0 ms	251116 KB	Output is correct
22	Correct	3 ms	251116 KB	Output is correct
23	Correct	0 ms	251116 KB	Output is correct
24	Correct	3 ms	251116 KB	Output is correct
25	Correct	0 ms	251116 KB	Output is correct
26	Correct	0 ms	251116 KB	Output is correct
27	Correct	0 ms	251116 KB	Output is correct
28	Correct	0 ms	251116 KB	Output is correct
29	Correct	0 ms	251116 KB	Output is correct
30	Correct	0 ms	251116 KB	Output is correct
31	Correct	0 ms	251116 KB	Output is correct
32	Correct	0 ms	251116 KB	Output is correct
33	Correct	3 ms	251116 KB	Output is correct
34	Correct	0 ms	251116 KB	Output is correct
35	Correct	6 ms	251116 KB	Output is correct
36	Correct	0 ms	251116 KB	Output is correct
37	Correct	0 ms	251116 KB	Output is correct
38	Correct	3 ms	251116 KB	Output is correct
39	Correct	3 ms	251116 KB	Output is correct
40	Correct	0 ms	251116 KB	Output is correct
41	Correct	0 ms	251116 KB	Output is correct
42	Correct	0 ms	251116 KB	Output is correct
43	Correct	0 ms	251116 KB	Output is correct
44	Correct	3 ms	251116 KB	Output is correct
45	Correct	0 ms	251116 KB	Output is correct
46	Correct	3 ms	251116 KB	Output is correct
47	Correct	0 ms	251116 KB	Output is correct
48	Correct	0 ms	251116 KB	Output is correct
49	Correct	0 ms	251116 KB	Output is correct
50	Correct	0 ms	251116 KB	Output is correct

Subtask #2
0 / 5.0

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

Submission #22547

Compilation message

Subtask #1 2.0 / 2.0

Subtask #2 0 / 5.0

Subtask #1
2.0 / 2.0

Subtask #2
0 / 5.0