Submission #22291

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
22291	2017-04-30T03:39:39 Z	크리콘 B번 문제는 그리디로 풀려요(#918, imsifile)	Fully Generate (KRIII5_FG)	C++	2 / 7	500 ms	130060 KB

FG

#include<stdio.h>

typedef long long lld;
const lld mx = 1000000000000;
const lld mod = 1000000007;

lld exp(lld a, lld b){
	lld g=1, a0=a, b0=b;
	while(b){
		if(b&1)g=g*a%mod;
		b>>=1, a=a*a%mod;
	}
	return g;
}

int poi[33010101], cnt;
lld sum, N;

int main(){
	poi[1]=1;
	poi[2]=poi[3]=2; cnt=4; sum=5;
	for(int i=3;; i++){
		for(int j=poi[i]; j--;) poi[cnt++]=i, sum+=i;
		if(sum > mx) break;
	}
	scanf("%lld", &N); lld dap=1;
	for(int i=1; i<cnt; i++){
		if(N >= poi[i]) dap = dap*exp(i,poi[i])%mod, N -= poi[i];
		else { dap = dap*exp(i,N)%mod; break; }
	}
	printf("%lld", dap);
	return 0;
}

Compilation message

FG.cpp: In function 'lld exp(lld, lld)':
FG.cpp:8:11: warning: unused variable 'a0' [-Wunused-variable]
  lld g=1, a0=a, b0=b;
           ^
FG.cpp:8:17: warning: unused variable 'b0' [-Wunused-variable]
  lld g=1, a0=a, b0=b;
                 ^
FG.cpp: In function 'int main()':
FG.cpp:26:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &N); lld dap=1;
                   ^

Subtask #1

2.0 / 2.0

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

Subtask #2

0 / 5.0

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