Submission #19772

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
19772	2016-02-25T05:27:34 Z	myungwoo	동전 (kriii4_E)	C++14	0 / 100	0 ms	16728 KB

D

#include<stdio.h>
#include<memory.h>
#define mod 1000000007
#define inv(a) exp(a,mod-2)

typedef long long lld;

lld exp(lld a, lld b){
	if(b<=0)return 1;
	lld k=exp(a, b/2);
	k=(k*k)%mod;
	if(b%2)k=(k*a)%mod;
	return k;
}

lld fac[1001001], rfac[1001001];

void init(){
	lld i;
	fac[0]=rfac[0]=1;
	for(i=1; i<=1000000; i++){
		fac[i]=(fac[i-1]*i)%mod;
		rfac[i]=inv(fac[i]);
	}
}

lld comb(lld a, lld b){
	return fac[a]*rfac[b]%mod*rfac[a-b]%mod;
}

lld n, grd[251], dy[251];
bool chk[251];

int main(){
	lld i, j, k;
//	init();
	scanf("%d", &n);
	printf("%lld", exp(2,n-2));
	return 0;
}

Subtask #1

0.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	16728 KB	Output is correct
2	Correct	0 ms	16728 KB	Output is correct
3	Correct	0 ms	16728 KB	Output is correct
4	Correct	0 ms	16728 KB	Output is correct
5	Correct	0 ms	16728 KB	Output is correct
6	Incorrect	0 ms	16728 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #2

0.0 / 95.0

#	Verdict	Execution time	Memory	Grader output
1	Halted	0 ms	0 KB	-