Created
March 28, 2020 16:57
-
-
Save kiemrong08/8180b00a3c10b9ee5b8305f40b1f3a7a to your computer and use it in GitHub Desktop.
#thuattoan #giaithua
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<iostream> | |
using namespace std; | |
#define MAX 500 | |
int multiply(int x, int res[], int res_size); | |
void factorial(int n) | |
{ | |
int res[MAX]; | |
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; | |
for (int i=0; i<res_size; i++) | |
{ | |
int prod = res[i] * x + carry; | |
res[i] = prod % 10; | |
carry = prod/10; | |
} | |
while (carry) | |
{ | |
res[res_size] = carry%10; | |
carry = carry/10; | |
res_size++; | |
} | |
return res_size; | |
} | |
int main() | |
{ | |
factorial(200); | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment