#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
typedef long long ll;
ll exp(ll a, ll b, ll m) {
ll r=1;
while(b) {
if(b%2) r=(r*a)%m;
a=(a*a)%m;
b/=2;
}
return r;
}
int main() {
ll a,x; cin>>a>>x;
a%=mod;
cout << exp(a,x,mod) << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
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 |