Cod sursa(job #2036556)
Utilizator | Data | 10 octombrie 2017 20:02:22 | |
---|---|---|---|
Problema | Factorial | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int i,j,k,l,n,a=0,b=0,m;
ifstream f("fact.in");
ofstream g("fact.out");
f>>n;
if(n==0)g<<1;
else{
if(n==1)g<<5;
else{
n--;
i=10;
while(n>0){
j=i;
while(j%2==0){a++;j=j/2;}
j=i;
while(j%5==0){b++;j=j/5;}
if(b>0){
if(a>0){
a--;b--;n--;
}
}
i++;
}
g<<--i;
}
}
}