Submission #16928

#	Time	Username	Problem	Language	Result	Execution time	Memory
16928		taehoon1018	팩토리얼 세제곱들의 합 (YDX14_fact)	C11	0 / 1	1000 ms	1084 KiB

fact

#include <stdio.h>

int factorial(int n)
{
	if (n < 1)
		return 1;
	else
		return n*factorial(n - 1);
}

int Pow(int a, int b)
{
	int i, res=1;
	for (i = 0; i < b; i++)
	{
		res *= a;
	}
	return res;
}

int 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);
	
	return 0;

}

• Subtask 1: 0 / 1