-
Notifications
You must be signed in to change notification settings - Fork 12
/
Copy pathExtraLongFactorials.cpp
113 lines (83 loc) · 1.85 KB
/
ExtraLongFactorials.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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
string rev(string a){
int n = a.size();
for(int i = 0; i < n/2; i++){
char t = a[n-i-1];
a[n-i-1] = a[i];
a[i] = t;
}
return a;
}
string multiply(string a, int b){
string ans = "";
a = rev(a);
int carry = 0;
for(int i = 0; i < a.size(); i++){
int sum = carry + (a[i] - '0')*b;
ans = ans + to_string(sum%10);
carry = sum/10;
}
if(carry){
ans = ans + to_string(carry);
}
return rev(ans);
}
string add(string a, string b){
int n = a.size(), m = b.size(), carry = 0, i = 0;
string ans = "";
a = rev(a);
b = rev(b);
while(i < n && i < m){
int sum = carry + a[i] - '0' + b[i] - '0';
ans = ans + to_string(sum%10);
carry = sum/10;
i++;
}
while(i < n){
int sum = carry + a[i] - '0';
ans = ans + to_string(sum%10);
carry = sum/10;
i++;
}
while(i < m){
int sum = carry + b[i] - '0';
ans = ans + to_string(sum%10);
carry = sum/10;
i++;
}
if(carry){
ans = ans + to_string(carry);
}
return rev(ans);
}
string mult(string a, string b){
int n = a.size(), m = b.size(), i = 0, count = 0;
string ans = "";
b = rev(b);
while(i < m){
int temp = b[i] - '0';
if(count){
a = a + "0";
}
ans = add(ans, multiply(a, temp));
count++;
i++;
}
return ans;
}
int main(){
int n;
cin >> n;
string ans = "1";
while(n){
ans = mult(ans, to_string(n));
n--;
}
cout << ans;
return 0;
}