Cod sursa(job #2285862)
Utilizator | Data | 19 noiembrie 2018 13:46:38 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long mult,n,ptr=25,ccptr,cptr=25,ctr=1;
int main()
{
f >> n;
if (n==0)
g << 1;
else {
mult=5*n;
ccptr=cptr;
while (ptr<mult) {
while (cptr<=mult) {
mult-=5*ctr;
cptr+=ccptr;
}
ptr*=5;
cptr=ptr;
ctr++;
}
g << mult;
}
return 0;
}