| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 16933 | taehoon1018 | 팩토리얼 세제곱들의 합 (YDX14_fact) | C11 | 1000 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 factorial(int n)
{
	int i, res=1;
	for (i = 1; i <= n; i++)
		res *= i;
	return res;
}
int Pow(int a, int b)
{
	int i, res=1;
	for (i = 0; i < b; i++)
		res *= a;
	return res;
}
main(void)
{
	int n, k, sum = 0, i, res;
	scanf("%d %d", &n, &k);
	for (i = 0; i <= n; i++)
		sum += Pow(factorial(i), k);
	while (1)
	{
		res = sum % 10;
		if (res != 0)
			break;
	}
	printf("%d", res);
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
