Pagini recente » Diferente pentru problema/bfs intre reviziile 2 si 64 | Borderou de evaluare (job #2938721) | Borderou de evaluare (job #2788506) | Profil Alex007 | Cod sursa (job #30104)
Cod sursa(job #30104)
#include<stdio.h>
int cm(int a,int b)
{
int r;
r=a%b;
while(r)
{
a=b;
b=r;
r=a%b;
}
return b;
}
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
int i,j,n,nr=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(cm(i,j)==1)
nr++;
printf("%d\n",nr);
return 0;
}