# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
20152 |
2016-02-28T15:15:15 Z |
veckal |
Α (kriii4_P1) |
C |
|
0 ms |
1084 KB |
#include <stdio.h>
#define MOD 1000000007
typedef long long ll;
ll pow(ll base, ll exp) {
if (exp == 1) return base;
ll ret = pow(base, exp>>1);
ret = (ret * ret) % MOD;
if (exp&1) ret = (ret * base) % MOD;
return ret;
}
ll a, x;
int main() {
scanf("%lld%lld", &a, &x);
printf("%lld\n", pow(a%MOD, x));
return 0;
}
# |
Verdict |
Execution time |
Memory |
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 |