Cod sursa(job #1208636)
Utilizator | Data | 16 iulie 2014 11:42:24 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#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(legkisebb(i,j))
c++;
printf("%d",c);
}