Cod sursa(job #2788767)
Utilizator | Data | 26 octombrie 2021 13:57:23 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int main()
{
int n,v[10001]={0},c=1;
fin >> n;
v[1]=1;
for(int i=1;i<=n;i++)
{
int p=0;
for(int j=1;j<=c;j++)
{
int cif = v[j]*i+p;
v[j]=cif%10;
p=cif/10;
}
while(p)
{
v[++c]=p%10;
p/=10;
}
}
for(int i=c;i>=1;i--)
{
fout<<v[i];
}
return 0;
}