Cod sursa(job #83801)
Utilizator | Data | 11 septembrie 2007 22:27:33 | |
---|---|---|---|
Problema | Frac | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<stdio.h>
int n, p;
int prim(int x,int y)
{
while (x!=y)
{
if (x>y) x=x-y;
else y-=x;
}
if (x==1) return 1;
return 0;
}
void calcul()
{
int nr, contor=0;
freopen("frac.in","r",stdin);
scanf("%d%d",&n,&p);
nr=0;
while (contor<p)
{
nr++;
if (n%2==0 && nr%2==0);
else if (prim(n,nr)) contor++;
}
freopen("frac.out","w",stdout);
printf("%d",nr);
}
int main()
{
calcul();
return 0;
}