# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16926 | 2015-10-27T06:16:42 Z | taehoon1018 | 팩토리얼 세제곱들의 합 (YDX14_fact) | C | 0 ms | 0 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_s("%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; }