Cod sursa(job #2372710)
Utilizator | Data | 7 martie 2019 10:42:43 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.26 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long int p,x,z,y,n,i;
int main()
{ifstream f("fact.in");
ofstream g("fact.out");
f>>p;if(p==0) g<<1;
else{
x=p*5-1;
n=25;
while(n<x){
for(i=1;i<=x/n;i++) p--;
n=n*5;
}g<<p*5;
}
}