Pagini recente » Cod sursa (job #1053631) | Cod sursa (job #931487) | Cod sursa (job #1167582) | Cod sursa (job #1514645) | Cod sursa (job #2010867)
#include <stdio.h>
#include <stdlib.h>
#define in "pairs.in"
#define out "pairs.out"
#define MAX 2000000
char ciur[MAX];
int n, v[100001], nr;
int cmmdc(a,b){
int r;
while(b!=0){
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
freopen(in, "r", stdin);
freopen(out, "w", stdout);
scanf("%d",&n);
int i, j;
for ( i = 2; i*i <= 100000; i++){
if( ciur[i] == 0)
for(j= i*i; j<= 1000000; j +=i)
ciur[j] = 1;
}
for (i = 1; i <= n; i++)
scanf("%d",&v[i]);
for (i = 1; i < n; i++){
if(ciur[v[i]]==0){
for(j = i+1; j <=n; j ++)
if(v[j]%v[i]!=0)
nr++;
}
else
for(j = i+1; j <=n; j ++)
if(cmmdc(v[i],v[j])==1)
nr++;
}
printf("%d",nr);
return 0;
}