Pagini recente » Cod sursa (job #2122679) | Cod sursa (job #3198233) | Cod sursa (job #2880198) | Cod sursa (job #81888) | Cod sursa (job #1409545)
#include<fstream>
using namespace std;
ifstream fin("pairs.in");
ofstream fout("pairs.out");
int v[100005],p[100005];
int f[1000005],w[1000005];
long long nr,sol,k,n,i,j;
int main(){
fin>>n;
for(i=1;i<=n;i++){
fin>>v[i];
f[v[i]]=1;
}
k=0;
for(i=2;i<=1000005;i++){
if(w[i]==0){
if(f[i]==1){
nr++;
}
k++;
for(j=i+i;j<=1000005;j+=i){
if(f[j]==1 && f[i]==1){
p[k]++;
}
w[j]=1;
}
}
}
sol=((nr*nr*1LL-nr)/2);
for(i=1;i<=nr;i++){
sol+=(n-nr-p[i]);
}
fout<<sol<<"\n";
return 0;
}