Pagini recente » Cod sursa (job #117643) | Cod sursa (job #1366705) | Borderou de evaluare (job #2626930) | Borderou de evaluare (job #2619071) | Cod sursa (job #874474)
Cod sursa(job #874474)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{ long long n,p,k,l,r,m,i;
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
m=0;i=1;
k=l=r=0;
if (p==0) g<<1;
else
while (m<p)
{
i++;
if (i%10==0) k++;
else if(i%10==2) l++;
else if (i%10==5) r++;
m=m+k; k=0;
if(l!=0 && r!=0)
if (l<=r)
{m=m+l;
r=r-l;}
else
{m=m+r; m=m-r;}
}
cout<<i;
return 0;
}