답안 #19563

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
19563 2016-02-24T19:28:03 Z suzy Α (kriii4_P1) C++
100 / 100
0 ms 1084 KB
#include <stdio.h>

#define MOD 1000000007
typedef long long lli;

lli f(lli a, lli x) {
	if(x==0) return 1;
	if(x%2) return a*f(a,x-1)%MOD;
	else { lli m=f(a,x/2); return m*m%MOD; }
}

int main() {
	lli a, x;
	scanf("%lld %lld",&a,&x);
	a%=MOD;
	printf("%lld",f(a,x));
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 0 ms 1084 KB Output is correct
9 Correct 0 ms 1084 KB Output is correct
10 Correct 0 ms 1084 KB Output is correct
11 Correct 0 ms 1084 KB Output is correct
12 Correct 0 ms 1084 KB Output is correct
13 Correct 0 ms 1084 KB Output is correct
14 Correct 0 ms 1084 KB Output is correct
15 Correct 0 ms 1084 KB Output is correct
16 Correct 0 ms 1084 KB Output is correct
17 Correct 0 ms 1084 KB Output is correct
18 Correct 0 ms 1084 KB Output is correct
19 Correct 0 ms 1084 KB Output is correct
20 Correct 0 ms 1084 KB Output is correct