Geeksforgeeks Solution For " Large Factorial "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Large Factorial

Submit Your Solution :- Click Here 

Solution :- 

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);
    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;
    return res_size;

int main()
    int t;
    int n;
    return 0;


Geeksforgeeks Solution For " Large Factorial "

Previous Post
Next Post

post written by:

Hi, I’m Ghanendra Yadav, SEO Expert, Professional Blogger, Programmer, and UI Developer. Get a Solution of More Than 500+ Programming Problems, and Practice All Programs in C, C++, and Java Languages. Get a Competitive Website Solution also Ie. Hackerrank Solutions and Geeksforgeeks Solutions. If You Are Interested to Learn a C Programming Language and You Don't Have Experience in Any Programming, You Should Start with a C Programming Language, Read: List of Format Specifiers in C.
Follow Me