Cod sursa(job #109340)
Utilizator | Hasna Robert coderninu | Data | 25 noiembrie 2007 10:19:19 |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 1, Clasele 11-12 | Marime | 0.45 kb |
#include <stdio.h>
#define Nmax 100001
long n, c[Nmax], i, j, r;
long long rez;
int cmmdc(long x, long y) { while (y) { r=x%y; x=y; y=r; } return x==1?1:0; }
int main()
{
freopen("pairs.in", "r", stdin);
scanf("%ld\n", &n);
for (i=1; i<=n; i++) scanf("%ld\n", &c[i]);
for (i=1; i<n; i++)
for (j=i+1; j<=n; j++)
rez+=cmmdc(c[i],c[j]);
freopen("pairs.out", "w", stdout);
printf("%lld\n", rez);
fclose(stdout);
return 0;
}