Pagini recente » Cod sursa (job #2617374) | Cod sursa (job #2854073) | Clasament preoji_4 | Cod sursa (job #1821727) | Cod sursa (job #774707)
Cod sursa(job #774707)
#include<fstream>
#include<bitset>
#define dim 1000005
using namespace std;
bitset<1<<20>C;
ifstream f("pairs.in");
ofstream g("pairs.out");
long long p[dim],X[dim];
int main (){
long long x,n,i,j,MAX;
long long res=0;
f>>n;
MAX=0;
for(i=1;i<=n;i++){
f>>x;
C[x]=1;
if(MAX<x)
MAX=x;
}long long w=0;
w=(long long)(n*(n-1))/2;
for(i=2;i<=MAX;++i){
for(j=i;j<=MAX;j+=i){
X[i]+=C[j];
}
}
for(i=2;i<=MAX;++i) {
if(p[i]==0){
for(j=i*i;j<=MAX;j+=i*i)
p[j]=-1;
for(j=i;j<=MAX;j+=i)
if(p[j]>=0)
p[j]++;
}
}
for(i=2;i<=MAX;++i){
if(p[i]>0){
if(p[i]%2)
res+=(long long)((X[i])*(X[i]-1))/2;
else
res-=(long long)((X[i])*(X[i]-1))/2;
}
}
g<<w-res<<"\n";
return 0;
}