Pagini recente » Cod sursa (job #2099675) | Cod sursa (job #1302396) | Cod sursa (job #187216) | Cod sursa (job #1304875) | Cod sursa (job #140783)
Cod sursa(job #140783)
#include <stdio.h>
int pair (int a, int b);
long m[100001];
int n;
long k;
int main ()
{
freopen ("pairs.in","r",stdin);
freopen ("pairs.out","w",stdout);
int i,j;
scanf ("%d",&n);
for (i=1; i<=n; ++i)
scanf ("%ld",&m[i]);
for (i=1; i<n; ++i)
for (j=i+1; j<=n; ++j)
if (pair(m[i],m[j])==1)
++k;
printf ("%ld",k);
return 0;
}
int pair (int a, int b)
{
int a1,b1,r;
a1=a;
b1=b;
if (a1==b1)
return 0;
do
{
r=a%b;
a=b;
b=r;
}
while (r);
return a;
}