Pagini recente » Cod sursa (job #2677605) | Cod sursa (job #2199190) | Cod sursa (job #3039937) | Cod sursa (job #779352) | Cod sursa (job #2449179)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long factorial(long long n)
{
long long p=1;
for(long long i=2;i<=n;i++)
p=p*i;
return p;
}
int main()
{
long long N;
int P,nr=1,j;
cin>>P;
N=0;
for(j=1;j<=P;j++)
nr=nr*10;
int k=0;
do
{
N++;
cout<<N<<" "<<factorial(N)<<endl;
if(factorial(N)%nr==0) k=1;
else k=0;
}while(k==0);
g<<N;
}