Pagini recente » Cod sursa (job #1459266) | Istoria paginii runda/oji_2011 | Cod sursa (job #886106) | Cod sursa (job #821530) | Cod sursa (job #1092627)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int p,i,fact,nr,c,nrc;
int main()
{
f>>p;
for(i=0;ok==0;i++){
fact=0;
nr=0;
c=0;
nrc=1;
for(int j=1;j<=i;j++)
fact*=j;
for(int j=fact, k=1;k<=p && c==0;j++,k++){
if(fact%10==0)
nr++;
if(fact%10>0)
c=1;
}
if(nr==p){
ok=1;
g<<i;
}
}
return 0;
}