Pagini recente » Cod sursa (job #2625367) | Cod sursa (job #1348103) | Cod sursa (job #1023703) | Cod sursa (job #1512203) | Cod sursa (job #2094996)
#include <stdio.h>
int n;
bool euclid(int a,int b)
{
int c;
while(b)
{
c=a%b;
a=b;
b=c;
}
if(a==1)
return true;
else return false;
}
int rezolvare()
{
int s=0;
for(int p=1;p<=n;p++)
for(int q=1;q<=n;q++)
if(euclid(p, q))
s++;
return s;
}
int main()
{
FILE *f = fopen("fractii.in", "r");
fscanf(f,"%i",&n);
FILE *g = fopen("fractii.out", "w");
fprintf(g,"%d",rezolvare());
return 0;
}