Pagini recente » Cod sursa (job #2196402) | Cod sursa (job #409037) | Cod sursa (job #3223017) | Cod sursa (job #1635187) | Cod sursa (job #110012)
Cod sursa(job #110012)
#include <stdio.h>
#include <stdlib.h>
int M;
//int *set;
int* read_data(){
int i;
int *set;
FILE *f = fopen("pairs.in","r");
fscanf(f,"%d\n",&M);
set = (int*)malloc(M*sizeof(int));
for(i = 0;i < M; i++)
fscanf(f,"%d",&set[i]);
return set;
}
int gcd(int m, int n) {
int r;
if (m < n) {
int t = m;
m = n;
n = t;
}
r = m % n;
if (r == 0) {
return n;
} else {
return gcd(n, r);
}
}
int main(){
int i,j;
int co_primes = 0;
int* set = read_data();
FILE *out = fopen("pairs.out","w");
for(i = 0;i < M; i++)
for(j = i + 1;j < M; j++)
if(gcd(set[i],set[j]) == 1)
co_primes++;
fprintf(out,"%d",co_primes);
return 0;
}