Cod sursa(job #900834)
Utilizator | Data | 28 februarie 2013 22:03:53 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long p,n=1,i,ts,k;
short sw=1,test=1;
int main()
{
f>>p;
if(p>-1)
{
while(sw==1)
{
i++;
n=n*i;
ts=n;
test=1;
k=0;
while(ts!=0 && test==1)
{
if(ts%10==0)
{
k++;
}
else test=0;
ts=ts/10;
}
if(k==p) sw=0;
}
if(k==p) g<<i;
}
else g<<"-1";
return 0;
}