Pagini recente » Cod sursa (job #125086) | Cod sursa (job #1898708) | Cod sursa (job #1849771) | Cod sursa (job #1115895) | Cod sursa (job #206462)
Cod sursa(job #206462)
/*pairs*/
#include<fstream.h>
#include<math.h>
int a[1000002];
long n,x,cont,nr,max;
unsigned long contor;
ifstream fin("pairs.in");
ofstream fout("pairs.out");
int verifica(long x,long y)
{
long d;
for(d=2;d<=x/2;d++)
if(x%d==0 &&y%d==0)
return 0;
if(y%x==0)
return 0;
return 1;
}
int main()
{
long i,j;
fin>>n;
for(i=0;i<n;i++)
{
fin>>x;
a[x]=1;
if(max<x)
max=x;
}
for(i=2;i<max;i++)
{
nr=0;
if(a[i]==1)
{
cont++;
for(j=i+1;j<=max;j++)
if(a[j]==1)
if(verifica(i,j)==0)
nr++;
contor=contor+n-nr-cont;
}
}
fout<<contor<<'\n';
fout.close();
return 0;
}