oj.uz

Submission #16927

# Submission time Handle Problem Language Result Execution time Memory
16927 2015-10-27T06:17:02 Z taehoon1018 팩토리얼 세제곱들의 합 (YDX14_fact) C
0 / 1
 1000 ms 1084 KB 
#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.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1084 KB Output is correct - answer is '4'
2 Correct 0 ms 1084 KB Output is correct - answer is '2'
3 Correct 0 ms 1084 KB Output is correct - answer is '2'
4 Correct 0 ms 1084 KB Output is correct - answer is '2'
5 Correct 0 ms 1084 KB Output is correct - answer is '2'
6 Correct 0 ms 1084 KB Output is correct - answer is '4'
7 Correct 0 ms 1084 KB Output is correct - answer is '6'
8 Execution timed out 1000 ms 1080 KB Program timed out
9 Halted 0 ms 0 KB -