Pagini recente » Cod sursa (job #2677079) | Cod sursa (job #2208596) | Cod sursa (job #1708040) | Statistici Rata Andrei (Fludorf) | Cod sursa (job #304006)
Cod sursa(job #304006)
#include <stdio.h>
#include <stdlib.h>
int e[2000005];
int b[2000004];
int maxim=-300000;
void ciur()
{
long long i,j;
b[1]=-1;
for(i=2;i<=maxim;i++)
if(b[i]==0)
for(j=i;j<=maxim;j=j+i)
if(b[j]!=-1)
{
b[j]++;
if((j/i)%i==0)
b[j]=-1;
}
}
int main()
{
long long i,j,bar,copiei,nr,div,n,a;
long long d=0;
FILE *f1,*f2;
f1=fopen("pairs.in","r");
f2=fopen("pairs.out","w");
fscanf(f1,"%lld",&n);
for(i=1;i<=n;i++)
{
fscanf(f1,"%lld",&a);
if(a>maxim)
maxim=a;
e[a]=true;
}
ciur();
for(i=2;i<=maxim;i++)
{
div=0;
if(b[i]==-1)
continue;
if(b[i]==0)
while(1)
{
a++;
a--;
}
else
for(j=i;j<=maxim;j=j+i)
if(e[j])
div++;
if(b[i]%2==1)
d=d+div*(div-1)/2;
else
d=d-div*(div-1)/2;
}
d=n*(n-1)/2-d;
fprintf(f2,"%lld",d);
fclose(f1);
fclose(f2);
return 0;
}