Cod sursa(job #1171503)
| Utilizator | Data | 15 aprilie 2014 20:14:51 | |
|---|---|---|---|
| Problema | Factorial | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int main()
{
int n,x,p;
long long pas,pas1=25;
fin>>p;
if(p==0) fout<<1;
else if(p==1) fout<<5;
else if(p==2) fout<<10;
else
{
n=3;
pas=15;
for(;;)
{
if(n>p) {fout<<-1;;break;}
else if(n==p) {fout<<pas;break;}
else
{
x=(pas1-pas)/5-1;
if(n<p&&n+x>=p)
{ pas=pas+(p-n)*5;
fout<<pas;break;}
else n+=x+2;
pas=pas1;
pas1*=5;
}
}
}
}
