Cod sursa(job #642598)
| Utilizator | Data | 1 decembrie 2011 19:50:25 | |
|---|---|---|---|
| Problema | Factorial | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.29 kb |
#include <fstream>
#include <iostream>
using namespace std;
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
unsigned long p,i,div5=0,n=1;
f>>p;
for(i=5; i<=2000000000 && p>div5; i++)
{
n=i;div5=0;
while(n)
{
div5+=n/5;
n/=5;
}
g<<n;
}
}
