# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
21159 | jayceking | 팩토리얼 세제곱들의 합 (YDX14_fact) | C++14 | 0 ms | 1116 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>
int pow(int a, int b, int c) {
if (b == 0) return c;
pow(a, b - 1, a*c);
}
int main() {
int n, k;
scanf("%d %d", &n, &k);
int d = 0;
int arr[5] = { 1,1,2,6,24 };
if (n > 4) {
for (int i = 0;i <= 4;++i) {
d += pow(arr[i], k, 1);
}
}
else {
for (int i = 0;i <= n;++i) {
d += pow(arr[i], k, 1);
}
}
while (d % 10==0) {
d /= 10;
}
printf("%d", d % 10);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |