# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
19339 |
2016-02-24T10:08:12 Z |
shjgkwo |
Α (kriii4_P1) |
C++ |
|
0 ms |
1084 KB |
#include <stdio.h>
#define MOD 1000000007
int main() {
long long n, m;
bool o[65];
int e = 0;
scanf("%lld", &n);
scanf("%lld", &m);
while (m > 0) {
o[e++] = m & 1;
m >>= 1;
}
long long ans = 1;
while (e--) {
ans *= ans;
ans %= MOD;
if (o[e]) {
ans *= n;
ans %= MOD;
}
}
printf("%lld", ans);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1084 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |