Cod sursa(job #1925333)
Utilizator | Data | 12 martie 2017 22:02:04 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.29 kb |
#include<iostream>
#include<math.h>
using namespace std;
int fact(int n)
{ if(n == 1)return 1;
else return n*fact(n-1);
}
int main()
{int p;
cin>>p;
if(p==0)cout<<'1';
else for(int i=1;i<=10000;i++)if(fact(i)%(pow(10,p)))==0){cout<<i; }
//cout<<fact(p);
return 0;
}