Pagini recente » Cod sursa (job #2871988) | Cod sursa (job #623287) | Cod sursa (job #2397017) | Borderou de evaluare (job #2759666) | Cod sursa (job #365227)
Cod sursa(job #365227)
#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("%i",&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("%i",nr);
}