Cod sursa(job #2416883)
Utilizator | Data | 28 aprilie 2019 14:40:57 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <bits/stdc++.h>
#define ll long long
ll p,n=1;
using namespace std;
int gcd(int a,int b){
if(b==0) return a;
return gcd(b,a%b);
}
int main() {
ifstream cin;
cin.open("fact.in");
ofstream cout;
cout.open("fact.out");
cin>>p;
for(int i=1;i<=p*5;i++){
n=n*i;
if(n==p*5){
cout<<n;
return 0;
}
}
cout<<"-1";
return 0;
}