Cod sursa(job #2358250)
Utilizator | Data | 27 februarie 2019 22:49:05 | |
---|---|---|---|
Problema | Frac | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("frac.in");
ofstream g("frac.out");
long long n,i,p,k,c[100001],gasit,x;
int cmmdc(int a,int b)
{
int r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
f>>n>>p;
for(i=1;i<=1000000&&gasit==0;i++)
{if(cmmdc(n,i)==1)
k++;
c[k]=i;
if(k==p)
{
gasit=1;
x=i;
}
}
g<<x;
}