Pagini recente » Cod sursa (job #2186037) | Cod sursa (job #2116332) | Cod sursa (job #1092538) | Cod sursa (job #2183765) | Cod sursa (job #1892777)
#include <stdio.h>
int getGreatestDivisor(int a, int b){
if(b == 0) return a;
return getGreatestDivisor(b, a % b);
}
int main(void)
{
FILE *in, *out;
int n, sum = 0;
in = fopen( "fractii.in", "r");
out = fopen( "fractii.out", "w");
fscanf(in, "%d", &n);
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(getGreatestDivisor(i, j) == 1){
sum++;
}
}
}
fprintf(out, "%d", sum);
return 0;
}