| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 19468 |
2016-02-24T13:19:42 Z |
joonas |
Α (kriii4_P1) |
C++ |
|
0 ms |
1720 KB |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long lld;
lld gpow(lld a, lld x){
if(x == 0) return 1;
if(x < 1) return a%MOD;
lld r = gpow(a, x/2)%MOD;
if(x&1) return ((r*r)%MOD * (a%MOD))%MOD;
return (r*r)%MOD;
}
int main(){
lld n, k;
scanf("%lld %lld", &n, &k);
printf("%lld", gpow(n, k)%MOD);
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1720 KB |
Output is correct |
