Pagini recente » Cod sursa (job #2943790) | Cod sursa (job #2649141) | Cod sursa (job #1037480) | Cod sursa (job #335502) | Cod sursa (job #360085)
Cod sursa(job #360085)
#include <stdio.h>
void read(),solve();
long p,q,n,nr,a,b,r;
int main()
{
read();
solve();
return 0;
}
void read()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%d",&n);
}
void solve()
{
nr=0;
for (p=1;p<=n;p++)
for(q=1;q<=n;q++)
{
if (p>=q)
{
b=p;
a=q;
}else{
a=p;
b=q;
}
while(b!=0)
{
r=a%b;
a=b;
b=r;
}
if(a==1)
nr++;
a=0;
b=0;
}
printf("%d",nr);
}