Pagini recente » Cod sursa (job #2128912) | Cod sursa (job #671850) | Cod sursa (job #2958685) | Cod sursa (job #536407) | Cod sursa (job #109704)
Cod sursa(job #109704)
#include <stdio.h>
const int N_MAX = 100010;
int v[N_MAX];
int MAX;
int prim(int a, int b)
{
if (a % 2 == 0 && b % 2 == 0) return 0;
for (int i = 3; i <= a / 2 && i <= b / 2; i ++) {
if (a % i == 0 && b % i == 0) return 0;
}
return 1;
}
int main()
{
freopen("pairs.in", "r", stdin);
#ifndef _SCREEN_
freopen("pairs.out", "w", stdout);
#endif
int N;
scanf("%d\n", &N);
int i, j;
for (i = 1; i <= N; i ++) {
scanf("%d ", &v[i]);
}
int rez = 0;
for (i = 1; i < N; i ++) {
for (j = i + 1; j <= N; j ++) {
if (prim(v[i], v[j])) rez ++;
}
}
printf("%d\n", rez);
return 0;
}