Cod sursa(job #2021075)
Utilizator | Data | 12 septembrie 2017 17:21:32 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.69 kb |
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
unsigned long long p;
unsigned long long n=1;
unsigned long long count=0;
unsigned long long fact(unsigned long long n)
{
unsigned long long factorial=1;
for(unsigned long long i=2;i<=n;i++){
factorial=factorial*i;
}
return factorial;
}
int main()
{
f>>p;
if(p==0){
g<<n;
}else{
for(long long i=5*(p-1);i<=5*p;i++){
if(fact(i)%(10^p)==0){
n=i;
break;
}
}
if(n!=1)
g<<n;
else
g<<-1;
}
}