Pagini recente » Cod sursa (job #613421) | Cod sursa (job #933869) | Cod sursa (job #2972656) | Cod sursa (job #1984612) | Cod sursa (job #1692439)
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int a[10000],n,x,i;
void afis(int a[])
{
int i;
for(i=a[0];i>=1;i--)
fout<<a[i];
}
void prod(int a[], int b)
{
int i,t=0;
for(i=1;i<=a[0];i++)
{
a[i]=a[i]*b+t;
t=a[i]/10;
a[i]%=10;
}
while(t>0)
{
a[++a[0]]=t%10;
t/=10;
}
}
int main()
{
fin>>n;
a[0]=1;
a[1]=1;
for(i=1;i<=n;i++)
prod(a, i);
afis(a);
fin.close();
fout.close();
return 0;
}