| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 19544 |
2016-02-24T17:05:07 Z |
metadata |
Α (kriii4_P1) |
C++14 |
|
0 ms |
1084 KB |
#include<cstdio>
#define MOD 1000000007
long long mod_bp[65];
long long A,X,r;
int main(){
scanf("%lld %lld",&A,&X);
mod_bp[0]=A%MOD;
if(1&X) r=mod_bp[0];
else r=1;
int i;
for(i=1;i<64 && (1ll<<i)<=X;i++){
mod_bp[i]=(mod_bp[i-1]*mod_bp[i-1])%MOD;
if((1ll<<i)&X){
r*=mod_bp[i];
r%=MOD;
}
}
printf("%lld",r);
return 0;
}
| # |
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 |
