#include <iostream>
#include <stdio.h>
using namespace std;
const int MOD = 1000000007;
long long a, x;
long long f(long long idx){
if (idx == 1) return a;
long long ret = 0;
long long k = f(idx / 2) % MOD;
if (idx % 2 == 1) ret = (((k*k)%MOD) *a )% MOD;
else ret = (k*k) % MOD;
return ret %= MOD;
}
int main(){
cin >> a >> x;
a %= MOD;
cout << f(x) % MOD;
}
# |
결과 |
실행 시간 |
메모리 |
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 |