Cod sursa(job #2326183)
Utilizator | Data | 23 ianuarie 2019 13:13:50 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | simulare_preoli | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ofstream fo("fact.out");
ifstream fi("fact.in");
int p;
long long fact=1,cinci,doi;
int main()
{
fi>>p;
while(1<2)
{
int copie=fact;
while(copie%5==0)
{
cinci++;
copie/=5;
}
while(copie%2==0)
{
doi++;
copie/=2;
}
if(doi==p || cinci==p)
{
fo<<fact;
break;
}
fact++;
}
return 0;
}