Cod sursa(job #109239)
Utilizator | Jurba Andrei znakeu | Data | 25 noiembrie 2007 09:31:24 |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 1, Clasele 11-12 | Marime | 0.56 kb |
#include <stdio.h>
int v[100001];
int n,pairs=0;
FILE *in = fopen("pairs.in","r");
FILE *out = fopen("pairs.out","w");
int div(int a, int b)
{
int r;
while (b)
{
r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
int i,j;
fscanf(in,"%d",&n);
for (i = 0; i < n; i++)
fscanf(in,"%d",&v[i]);
fclose(in);
for (i = 0; i < n - 1; i++)
for (j = i + 1; j < n; j++)
if (div(v[i],v[j])==1)
pairs++;
fprintf(out,"%d\n",pairs);
fclose(out);
return 0;
}