Pagini recente » Cod sursa (job #1997035) | Cod sursa (job #819942) | Cod sursa (job #967101) | Cod sursa (job #2290497) | Cod sursa (job #898191)
Cod sursa(job #898191)
#include <fstream>
using namespace std;
ifstream f("factorial.in");
ofstream g("factorial.out");
int n,kapcs=0,i=3,fact=2,j,szl=2;
long long x;
int megoldas()
{
while(kapcs==0)
{ szl++;
fact*=i;
i++;
if(fact%x==0)
return szl;
}
}
int main()
{
f>>n;
x=1;
for(j=1;j<=n;j++)
x*=10;
if(n==0)
g<<1;
else
{
megoldas();
g<<szl;
}
return 0;
}