-
Notifications
You must be signed in to change notification settings - Fork 37
/
Copy pathfactorial.cpp
54 lines (40 loc) · 1 KB
/
factorial.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
#include <iostream>
using namespace std;
int multiply(int x, int res[], int res_size);
void factorial(int n)
{
int MAX = 500;
int res[MAX];
// Initialize result
res[0] = 1;
int res_size = 1;
for (int x = 2; x <= n; x++)
res_size = multiply(x, res, res_size);
cout << "Factorial of given number is \n";
for (int i = res_size - 1; i >= 0; i--)
cout << res[i];
}
int multiply(int x, int res[], int res_size)
{
int carry = 0; // Initialize carry
// One by one multiply n with individual digits of res[]
for (int i = 0; i < res_size; i++) {
int prod = res[i] * x + carry;
// Store last digit of 'prod' in res[]
res[i] = prod % 10;
// Put rest in carry
carry = prod / 10;
}
// Put carry in res and increase result size
while (carry) {
res[res_size] = carry % 10;
carry = carry / 10;
res_size++;
}
return res_size;
}
int main()
{
factorial(1000);
return 0;
}