Cod sursa(job #675612)
| Utilizator |  Muresan Ionut ionutzu58 |
Data | 7 februarie 2012 20:21:08 |
|---|---|---|---|
| Problema | Factorial | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{long k=0,n=1,i=0,o=1,p,j=0;
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
while (o==1)
{i++;
n=n*i%1000;cout<<n<<" ";
if(i%5==0) {k++;
}
if (n%10==0) n=n/10;
if (k==p) o=0;
}
if (p==2) g<<10;
else g<<i-p/2;
f.close(); g.close();
return 0;
}