Cod sursa(job #1500355)
Utilizator | Data | 11 octombrie 2015 19:57:40 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int main()
{
unsigned long long int p,a[10],x=0,s=0,k,i;
fin>>p;
for(i=2;i<=9;i++)
{
a[i]=pow(5,i);
}
for(i=2;i<=9;i++)
{
if(a[i]<=5*p)
x++;
}
for(i=1;i<=x;i++)
{
s=s+i;
}
k=((p*5)-s)%5;
fout<<(p*5)-s-k;
}