#include <stdio.h>
int power(int a, int b)
{
int res = 1;
if (b == 0)
return 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 (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);
while (res == 0)
{
res = sum % 10;
sum /= 10;
}
printf("%d", res);
return 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 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '1' |
9 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '2' |
10 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '6' |
11 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '4' |
12 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '5' |
13 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '2' |
14 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '3' |
15 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '4' |
16 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '5' |
17 |
Incorrect |
0 ms |
1084 KB |
Output isn't correct - expected '6', found '5' |
18 |
Halted |
0 ms |
0 KB |
- |