# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16942 | taehoon1018 | 팩토리얼 세제곱들의 합 (YDX14_fact) | C++98 | 0 ms | 1084 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 <stdio.h>
int power(int a, int b)
{
int res = 1;
for (int i = 0; i < b; i++)
res *= a;
return res;
}
int factorial(int x)
{
int res = 1;
for (int i = 1; i <= x; i++)
{
res *= i;
}
return res;
}
int main(void)
{
int sum = 0, n, k, res=0;
scanf("%d %d", &n, &k);
if (k == 0)
sum = n + 1;
else if (n > 4)
for (int i = 0; i <= 4; i++)
sum += power(factorial(i), k);
else
for (int i = 0; i <= n; i++)
sum += power(factorial(i), k);
//printf("%d ", sum);
do
{
//printf("%d", res);
res = sum % 10;
sum /= 10;
} while (res == 0);
printf("%d ", res);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |