Cod sursa(job #2808753)
Utilizator | Data | 25 noiembrie 2021 15:34:26 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int main()
{
long long p;
int j=2,k=2;
long long n=0;
fin>>p;
for (int i=1; i<=p; i++){
n+=5;
if(n%int(pow(5,j))==0){
n-=5;
j++;}
if(n%int(pow(10,k))==0){
n-=5;
k++;}
}
fout<<n;
return 0;
}