Pagini recente » Cod sursa (job #1434652) | Cod sursa (job #1546229) | Cod sursa (job #153190) | Cod sursa (job #3209815) | Cod sursa (job #1208635)
#include <stdio.h>
bool legkisebb(int a,int b)
{
while(a!=b)
{
if(a>b)
a-=b;
else
b-=a;
}
if(a==1)
return true;
else
return false;
}
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
int n,c=0;
scanf("%d",&n);
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
if(((i%j!=0&&j%i!=0)||i==1||j==1)&&legkisebb(i,j))
c++;
printf("%d",c);
}