Pagini recente » Cod sursa (job #1465249) | Cod sursa (job #2481279) | Cod sursa (job #201281) | Cod sursa (job #1376051) | Cod sursa (job #2138885)
#include <fstream>
using namespace std;
ifstream cin("pairs.in");
ofstream cout("pairs.out");
const int nmax=1000000;
int n;
bool ap[nmax+5],viz[nmax+5];
long long ans,nr;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
int key;
cin>>key;
ap[key]++;
}
for(int i=2;i<=nmax;i+=2)
{
nr+=ap[i];
viz[i]=1;
}
ans=1ll*n*(n-1)/2;
ans-=nr*(nr-1)/2;
for(int i=3;i<=nmax;i+=2)
{
if(viz[i]==0)
{
nr=0;
for(int j=i;j<=nmax;j+=i)
{
viz[j]=0;
nr+=ap[j];
}
ans-=nr*(nr-1)/2;
}
}
cout<<ans;
return 0;
}
/**
**/