Cod sursa(job #919965)
| Utilizator | Data | 19 martie 2013 22:34:26 | |
|---|---|---|---|
| Problema | Factorial | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int pow(int k) {
int i,p=5;
for(i=0;p<k;i++) {
p*=5;
}
return i;
}
int main() {
long p;
f>>p;
if(p==0)
g<<1;
else {
int min=0;
for(int i=0;i<p;i++)
min+=5;
min-=pow(p)*5;
g<<min;
}
}
