-
Notifications
You must be signed in to change notification settings - Fork 114
/
Copy pathLarge_Factorial.cpp
56 lines (44 loc) · 943 Bytes
/
Large_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
55
56
#include <bits/stdc++.h>
using namespace std;
#define MAX 1000
int multiply(int x, int res[], int res_size);
void factorial(int x)
{
int res[MAX], res_size;
res[0] = 1;
res_size = 1;
for (int i = 2; i <= x; i++)
{
res_size = multiply(i, res, res_size);
}
for (int j = res_size - 1; j >= 0; j--)
{
cout << res[j];
}
cout << "\n";
}
int multiply(int x, int res[], int res_size)
{
int carry = 0, prod;
for (int i = 0; i < res_size; i++)
{
prod = res[i] * x + carry;
res[i] = prod % 10;
carry = prod / 10;
}
while (carry)
{
res[res_size++] = carry % 10;
carry = carry / 10;
}
return res_size;
}
int main()
{
int a;
printf("Enter the number: ");
scanf("%d", &a);
printf("The Factorial of %d is: ", a);
factorial(a);
return 0;
}