| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 19436 |
2016-02-24T12:34:00 Z |
nosiar |
Α (kriii4_P1) |
C++14 |
|
0 ms |
1716 KB |
#include <iostream>
using namespace std;
long long mod = 1000000007;
long long a,x;
long long m[65];
int main() {
cin>>a>>x;
m[1] = a % mod;
for(int i = 2; i <= 64; ++i)
m[i] = (m[i-1]*m[i-1])% mod;
long long ans = 1;
int i = 1;
while(x)
{
if(x&1) ans = (ans*m[i])%mod;
x >>= 1;
++i;
}
cout << ans << 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 |
