# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4337 | 2013-09-17T08:23:41 Z | zorrapower | Great Pow! (kriii1_G) | C++ | 0 ms | 1088 KB |
#include<stdio.h> long long pow(long long a, long long n); int main(void){ long long a, k; scanf("%lld %lld", &a, &k); printf("%lld", pow(a, a)%a+1); return 0; } long long pow(long long a, long long n){ long long result=1; for(long long i=0; i<n; i++) result*=a; return result; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 1088 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |