Cod sursa(job #8065)
Utilizator | Data | 23 ianuarie 2007 19:42:10 | |
---|---|---|---|
Problema | Factorial | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<fstream.h>
int main ()
{
ifstream f("fact.in");
ofstream g("fact.out");
int p,n;
f>>p;
n=1;
int k=0;
int div5=0, div2=0;
while (k!=p)
{
n++;
int x;
x=n;
while(x%2==0)
{
x=x/2;
div2++;
}
while(x%5==0)
{
x=x/5;
div5++;
}
if(div2>div5)
k=div5;
else
k=div2;
}
g<<n;
g.close ();
return 0;
}