Pagini recente » Cod sursa (job #497521) | Cod sursa (job #2658350) | Cod sursa (job #927836) | Cod sursa (job #2706552) | Cod sursa (job #360465)
Cod sursa(job #360465)
#include<stdio.h>
#include<string.h>
long n,i,a[100050],f[1000050],x[1000050],j,max;
long long s;
int main()
{
freopen("pairs.in","r",stdin);
freopen("pairs.out","w",stdout);
scanf("%ld",&n);
for(i=1;i<=n;++i)
{scanf("%ld",&a[i]);
if(a[i]>max)max=a[i];
f[a[i]]=1;}
for(i=2;i<=max;++i)
for(j=1;j<=max/i+1;++j)
if(i*j<=max)x[i]+=f[i*j];
memset(f,0,sizeof(f));
for(i=2;i<=max;++i)
if(f[i]==0)
for(j=1;j<=max/i+1;++j)
if(i*j<=max)
{if(j%i==0)f[i*j]=-1;
if(f[i*j]>-1)f[i*j]++;}
for(i=2;i<=max;++i)
if(f[i]>0)
if(f[i]%2)s+=(x[i]*(x[i]-1)/2);
else s-=(x[i]*(x[i]-1)/2);
printf("%lld\n",(long long)(n*(n-1)/2)-s);
return 0;
}