| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 19346 |
2016-02-24T10:19:29 Z |
pang |
Α (kriii4_P1) |
C++ |
|
0 ms |
1720 KB |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<string>
using namespace std;
#define MOD 1000000007
int main()
{
long long int x, a;
cin >> a;
cin >> x;
string s;
a %= MOD;
while (x > 0)
{
s += '0' + (x & 1);
x >>= 1;
}
reverse(s.begin(), s.end());
int l = s.length();
long long int ans = 1;
for (int i = 0; i < l; i++)
{
ans *= ans;
ans = ans%MOD;
if (s[i] == '1')
{
ans *= a;
ans = ans%MOD;
}
}
cout << ans << endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1720 KB |
Output is correct |
