# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3706 | jays | Great Pow! (kriii1_G) | C++98 | 0 ms | 1088 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
typedef long long ll;
ll a, k;
ll solve(ll n) {
if (n == 1) return a;
if (n == 2) return (a*a) % (a+1);
ll tmp = solve(n/2) % (a+1);
ll ret = (tmp*tmp) % (a+1);
if (n % 2 == 0)
return ret;
else
return (a*ret) % (a+1);
}
int main() {
scanf("%lld%lld", &a, &k);
if (k == 0)
printf("%lld\n", a);
else
printf("%lld\n", solve(a));
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |