Pagini recente » Cod sursa (job #1628080) | Istoria paginii runda/pq/clasament | Cod sursa (job #246645) | Cod sursa (job #291234) | Cod sursa (job #302969)
Cod sursa(job #302969)
#include <stdio.h>
#include <stdlib.h>
bool e[2000005];
int b[2000004];
int maxim=0;
void ciur()
{
int 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()
{
int i,j,bar,copiei,nr,div,a;
long long d=0,n;
FILE *f1,*f2;
f1=fopen("pairs.in","r");
f2=fopen("pairs.out","w");
fscanf(f1,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(f1,"%d",&a);
e[a]=true;
}
ciur();
for(i=2;i<=maxim;i++)
{
div=0;
if(b[i]==-1)
continue;
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,"%d",d);
fclose(f1);
fclose(f2);
return 0;
}