-
Notifications
You must be signed in to change notification settings - Fork 0
/
alphabet.cpp
88 lines (81 loc) · 1.15 KB
/
alphabet.cpp
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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include<stdio.h>
int a[10100],b[10100],N;
void mul_a(int x)
{
int carry=0;
for(int i=1;i<=a[0];++i)
{
int y=a[i]*x+carry;
a[i]=y%10;
carry=y/10;
}
while(carry>0)
{
++a[0];
a[a[0]]=carry%10;
carry=carry/10;
}
}
void mul_b(int x)
{
int carry=0;
for(int i=1;i<=b[0];++i)
{
int y=b[i]*x+carry;
b[i]=y%10;
carry=y/10;
}
while(carry>0)
{
++b[0];
b[b[0]]=carry%10;
carry=carry/10;
}
}
void pow(int x)
{
for(int i=1;i<=x;++i)
{
mul_a(x);
}
}
void fact(int x)
{
for(int i=1;i<=x;++i)
mul_b(i);
}
void subtract()
{
int carry=0;
for(int i=1;i<=a[0];++i)
{
if(a[i]>=b[i]+carry)
{
a[i]=a[i]-b[i]-carry;
carry=0;
}
else
{
a[i]=a[i]+10-carry-b[i];
carry=1;
}
}
}
void show()
{
for(int i=a[0];i>=1;--i)
printf("%d",a[i]);
}
int main()
{
scanf("%d",&N);
a[0]=1;
a[1]=1;
b[0]=1;
b[1]=1;
pow(N);
fact(N);
subtract();
show();
return 0;
}