# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16923 | taehoon1018 | 팩토리얼 세제곱들의 합 (YDX14_fact) | C11 | 0 ms | 0 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>
#include <math.h>
#include <stdlib.h>
int factorial(int n)
{
if (n < 1)
return 1;
else
return n*factorial(n - 1);
}
int main(void)
{
int n, k, sum = 0, i, res;
scanf_s("%d %d", &n, &k);
for (i = 0; i <= n; i++)
{
sum += pow((double)factorial(i), k);
}
while (1)
{
res = sum % 10;
if (res != 0)
break;
}
printf("%d", res);
return 0;
}