Pagini recente » Cod sursa (job #1969845) | Cod sursa (job #1368444) | Istoria paginii verkhoyansk/solutie | Cod sursa (job #705721) | Cod sursa (job #1451236)
#include <iostream>
#include<math.h>
#include<stdlib.h>
#include<fstream>
using namespace std;
ifstream in("fact.in");
ofstream out("fact.out");
int main()
{
int P,n=1,s=0,i=5,count=0,x=5,cc=0;
in>>P;
while (i<P*5)
{
i=i*5;
cc++;
}
i=i/i;
cc--;
for(n=1;n<=cc;n++)
{
s=s+n;
}
//cout<<s;
s=P*5-5*s;
/*while (1)
{
if (x==i)
{
cc++;
x=x*x;
count=count+cc-2;
}
i=i+5;
count++;
if (count==P) break;
}*/
out<<s;
}