#include <stdio.h>
#define M 40
#define B 1000000000000
int power(int a, int k) {
return k == 0 ? 1 : power(a, k - 1) * a;
}
int main() {
static long long aa[M], ss[M];
int n, k, h, i, x;
scanf("%d%d", &n, &k);
aa[0] = ss[0] = 1;
for (i = 1; i <= n; i++) {
x = power(i, k);
for (h = 0; h < M; h++)
aa[h] *= x;
for (h = 0; h + 1 < M; h++)
aa[h + 1] += aa[h] / B, aa[h] %= B;
if (aa[M - 1] >= B) {
printf("bad\n");
return 0;
}
for (h = 0; h < M; h++)
ss[h] += aa[h];
for (h = 0; h + 1 < M; h++)
ss[h + 1] += ss[h] / B, ss[h] %= B;
if (ss[M - 1] >= B) {
printf("bad\n");
return 0;
}
}
h = 0;
while (ss[h] == 0)
h++;
while (ss[h] % 10 == 0)
ss[h] /= 10;
printf("%lld\n", ss[h] % 10);
return 0;
}
Compilation message
fact.c: In function 'main':
fact.c:14:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
14 | scanf("%d%d", &n, &k);
| ^~~~~~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
answer is '4' |
2 |
Correct |
0 ms |
348 KB |
answer is '2' |
3 |
Correct |
0 ms |
348 KB |
answer is '2' |
4 |
Correct |
0 ms |
348 KB |
answer is '2' |
5 |
Correct |
0 ms |
348 KB |
answer is '2' |
6 |
Correct |
0 ms |
348 KB |
answer is '4' |
7 |
Correct |
0 ms |
348 KB |
answer is '6' |
8 |
Correct |
0 ms |
348 KB |
answer is '1' |
9 |
Correct |
0 ms |
348 KB |
answer is '2' |
10 |
Correct |
0 ms |
348 KB |
answer is '6' |
11 |
Correct |
0 ms |
348 KB |
answer is '4' |
12 |
Correct |
0 ms |
348 KB |
answer is '5' |
13 |
Correct |
0 ms |
348 KB |
answer is '2' |
14 |
Correct |
0 ms |
344 KB |
answer is '3' |
15 |
Correct |
0 ms |
348 KB |
answer is '4' |
16 |
Correct |
0 ms |
348 KB |
answer is '5' |
17 |
Correct |
0 ms |
348 KB |
answer is '6' |
18 |
Correct |
0 ms |
348 KB |
answer is '7' |
19 |
Correct |
0 ms |
348 KB |
answer is '8' |
20 |
Correct |
0 ms |
348 KB |
answer is '9' |
21 |
Correct |
0 ms |
348 KB |
answer is '1' |
22 |
Correct |
0 ms |
348 KB |
answer is '6' |
23 |
Correct |
0 ms |
348 KB |
answer is '3' |
24 |
Correct |
1 ms |
348 KB |
answer is '7' |
25 |
Correct |
0 ms |
348 KB |
answer is '3' |
26 |
Correct |
1 ms |
348 KB |
answer is '1' |
27 |
Correct |
0 ms |
348 KB |
answer is '2' |
28 |
Correct |
0 ms |
348 KB |
answer is '1' |
29 |
Correct |
0 ms |
348 KB |
answer is '1' |
30 |
Correct |
0 ms |
344 KB |
answer is '1' |
31 |
Correct |
0 ms |
348 KB |
answer is '4' |
32 |
Correct |
0 ms |
348 KB |
answer is '4' |
33 |
Correct |
0 ms |
348 KB |
answer is '4' |
34 |
Correct |
0 ms |
348 KB |
answer is '4' |
35 |
Correct |
0 ms |
344 KB |
answer is '4' |
36 |
Correct |
0 ms |
348 KB |
answer is '4' |
37 |
Correct |
0 ms |
348 KB |
answer is '4' |
38 |
Correct |
0 ms |
348 KB |
answer is '4' |
39 |
Correct |
0 ms |
348 KB |
answer is '4' |
40 |
Correct |
0 ms |
348 KB |
answer is '8' |
41 |
Correct |
0 ms |
348 KB |
answer is '8' |
42 |
Correct |
0 ms |
344 KB |
answer is '8' |
43 |
Correct |
0 ms |
348 KB |
answer is '8' |
44 |
Correct |
0 ms |
348 KB |
answer is '8' |
45 |
Correct |
0 ms |
348 KB |
answer is '8' |
46 |
Correct |
0 ms |
852 KB |
answer is '8' |
47 |
Correct |
0 ms |
348 KB |
answer is '8' |
48 |
Correct |
0 ms |
348 KB |
answer is '8' |
49 |
Correct |
0 ms |
344 KB |
answer is '5' |
50 |
Correct |
0 ms |
348 KB |
answer is '5' |
51 |
Correct |
0 ms |
344 KB |
answer is '5' |
52 |
Correct |
0 ms |
344 KB |
answer is '5' |
53 |
Correct |
0 ms |
348 KB |
answer is '5' |
54 |
Correct |
0 ms |
348 KB |
answer is '5' |
55 |
Correct |
0 ms |
348 KB |
answer is '5' |
56 |
Correct |
0 ms |
348 KB |
answer is '5' |
57 |
Correct |
0 ms |
348 KB |
answer is '5' |