UVA 623 500! Solution

Solution in C++:

///**********ALLAH IS ALMIGHTY************///
///AH Tonmoy
///Department of CSE,23rd Batch
///Islamic University,Bangladesh
#include<iostream>
using namespace std;
int main()
{

    int n,temp,ar[5000],i,j,c,v;
    while(cin>>n)
    {
        ar[0]=1;
        c=1;
        temp=0;
        for(i=1; i<=n; i++)
        {
            for(j=0; j<c; j++)
            {
                v=ar[j]*i+temp;
                ar[j]=v%10;
                temp=v/10;
            }
            while(temp>0)
            {
                ar[c]=temp%10;
                temp=temp/10;
                c++;
            }
        }
        cout<<n<<"!"<<endl;
        for(i=c-1; i>=0; i--)
        {
            cout<<ar[i];
        }
        cout<<endl;

    }
}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.