#include<stdio.h>
long long pow(long long a, long long n);
int main(void){
long long a, k;
long long result;
scanf("%lld %lld",&a, &k);
result=a;
for(int i=0; i<k; i++){
result=pow(a, result)%(a+1);
}
printf("%d", result);
return 0;
}
long long pow(long long a, long long n){
long long result=1;
for(int i=0; i<n; i++)
result=(result*a);
return result;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1088 KB |
Output is correct |
2 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |