| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 19355 |
2016-02-24T10:27:16 Z |
bshnet |
Α (kriii4_P1) |
C++14 |
|
0 ms |
1716 KB |
#include <iostream>
#define MOD (1000000007)
using namespace std;
int pow(int64_t a, int64_t x) {
int64_t sq[64];
int ans = 1;
sq[0] = (a % MOD);
for(int i = 1; i <= 64; ++i) {
if(x & 0x01)
ans = (ans * sq[i-1]) % MOD;
x >>= 1;
if(!x)
break;
sq[i] = (sq[i-1] * sq[i-1]) % MOD;
}
return ans;
}
int main(void) {
int64_t A, X;
cin >> A >> X;
cout << pow(A, X) << endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1716 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1716 KB |
Output is correct |
