| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 19392 |
2016-02-24T11:11:11 Z |
kdh9949 |
Α (kriii4_P1) |
C++ |
|
0 ms |
1084 KB |
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
ll a, b;
ll mod = 1000000007;
ll pw(ll x, ll k){
if(k == 0) return 1;
if(k == 1) return x;
ll t = pw(x, k / 2); t *= t; t %= mod;
if(k % 2) return t * x % mod;
return t;
}
int main(){
scanf("%lld%lld", &a, &b);
printf("%lld\n", pw(a % mod, b));
}
| # |
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 |
