-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathn-factorial.c
41 lines (36 loc) · 893 Bytes
/
n-factorial.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
/*************************************************************************
> File Name: n-jiecheng.c
> Author:
> Mail:
> Created Time: 2019年01月05日 星期六 14时34分48秒
************************************************************************/
#include<stdio.h>
#define max 100000
int num[max + 5] = {0};
void f(int n) {
num[1] = num[0] = 1;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= num[0]; j++) {
num[j] *= n;
}
for(int j = 1;j <= num[0]; j++) {
if(num[j] < 10) continue;
num[i + 1] = num[i] / 10;
num[i] %= num[i];
num[0] += (i == num[0]);
}
}
}
int mi(int n) {
if(n == 1) return 1;
return n * mi(n - 1);
}
int main() {
int n = 0;
while(~scanf("%d", &n)) {
int ans = mi(n);
printf("%d\n", ans);
}
;
return 0;
}