Pagini recente » Cod sursa (job #1424084) | Cod sursa (job #1510743) | Cod sursa (job #1573141) | Cod sursa (job #2507941) | Cod sursa (job #1617038)
#include<stdio.h>
int checkForCoPrime(int a, int b) {
int i;
if((a > 1) && (b > 1)) {
if(a == b) {
return 0;
}
if((a > b)) {
if(a % b == 0) {
return 0;
}
for(i = 2; i <= b/2; i++) {
if((a % i == 0) && (b % i ==0)) {
return 0;
}
}
}
if((b > a)) {
if(b % a == 0) {
return 0;
}
for(i = 2; i <= a/2; i++) {
if((b % i == 0) && (a % i == 0)) {
return 0;
}
}
}
}
return 1;
}
int main() {
int n;
int counter = 0, i, j;
FILE *fp;
fp=fopen("fractii.in", "r");
fscanf(fp, "%d", &n);
fclose(fp);
for(i = 1; i <= n; i++) {
for(j = 1; j <= n; j++) {
if(checkForCoPrime(i, j)) {
counter++;
}
}
}
FILE *fo = fopen("fractii.out", "w");
fprintf(fo, "%d", counter);
fclose(fo);
return 0;
}