Cod sursa(job #705062)
| Utilizator |  galeteanu ovidiu ovidiu11 |
Data | 3 martie 2012 00:14:54 |
|---|---|---|---|
| Problema | Factorial | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.26 kb |
#include<fstream>
using namespace std;
int main()
{long long a,p=0,n,i,j,pb=0;
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
pb=0;
i=1;
while(pb<p)
{i=i+1;
n=n*i;
j=i;
while(j%5==0)
{j=j/5; pb=pb+1;}}
g<<i;
f.close();
g.close();
return 0;}