Cod sursa(job #278437)
Utilizator | Andrei Ilisei tinky | Data | 12 martie 2009 12:28:54 |
---|---|---|---|
Problema | Frac | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include<fstream.h>
#include<math.h>
long long n,p,i,cn,ci;
int main()
{int c=1;
ifstream in("frac.in");
ofstream out("frac.out");
in>>n;
in>>p;
if (n%2==0)
{for (i=3;i<=pow(2,63)&&c!=p;i=i+2)
{cn=n;
ci=i;
while (ci!=cn)
{if (ci>cn)
ci=ci-cn;
else
cn=cn-ci;
}
if (ci==1)
c++;
}
i=i-2;
}
if (n%2!=0)
{for (i=2;i<=pow(2,63)&&c!=p;i=i+2)
{cn=n;
ci=i;
while (ci!=cn)
{if (ci>cn)
ci=ci-cn;
else
cn=cn-ci;}
if (ci==1)
c++;
}
i=i-1;
}
out<<i;
in.close();
out.close();
return 0;
}