| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 19329 |
2016-02-24T09:47:56 Z |
isac322 |
Α (kriii4_P1) |
C++14 |
|
0 ms |
1084 KB |
#include <cstdio>
#include <algorithm>
using namespace std;
const long long MOD = 1000000007;
long long a, x;
long long solve(long long n) {
if (n == 1) return a;
long long ret = solve(n >> 1);
return (((ret*ret) % MOD) * (n & 1LL ? a : 1LL)) % MOD;
}
int main() {
scanf("%lld%lld", &a, &x);
a %= MOD;
printf("%lld", solve(x));
}
| # |
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 |
