Cod sursa(job #1693478)
Utilizator | Gabi Tulba-Lecu GabiTulba | Data | 23 aprilie 2016 10:46:04 |
---|---|---|---|
Problema | Factorial | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
#include <bitset>
#include <cmath>
using namespace std;
ifstream in("fact.in");
ofstream out("fact.out");
unsigned long long pw[1000]={},n,S=0;
bool prop=true;
int main()
{
in>>n;
pw[1]=1;
int i=1;
while(pw[i]<n)
{
i++;
pw[i]=pw[i-1]*5+1;
}
if(n==0)
prop=false;
while(n>0)
{
if(pw[i]<=n)
{
n-=pw[i];
S+=pow(5,i+0.0f);
}
else
i--;
}
if(prop==true)
out<<S;
else
out<<1;
return 0;
}