Pagini recente » Cod sursa (job #122689) | Cod sursa (job #563722) | Cod sursa (job #1585631) | Cod sursa (job #1531593) | Cod sursa (job #124761)
Cod sursa(job #124761)
#include<fstream.h>
ifstream in("pairs.in");
ofstream out("pairs.out");
double n,a[100000][1000000],t,max,i,j,k,w;
void read()
{
in>>n;
for(i=1;i<=n;i++)
{
k++;
in>>w;
if(max<w)
max=w;
a[k][w]=1;
for(j=2;j<=w/2;j++)
if(w%j==0)
a[k][j]=1;
}
}
void loading()
{
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
{
int ok=1;
for(k=1;k<=max;k++)
if(a[i][k]==1&&a[j][k]==1)
k=max,ok=0;
if(ok==1)
t++;
}
}
int main()
{
read();
loading();
out<<t;
in.close();
out.close();
return 0;
}