Pagini recente » Cod sursa (job #560746) | Cod sursa (job #1279360) | Cod sursa (job #2059983) | Cod sursa (job #745129) | Cod sursa (job #111126)
Cod sursa(job #111126)
//pairs
#include<fstream.h>
int main()
{long int n, m[100001],i,j,nr=0,t;
ifstream f("pairs.in");
ofstream g("pairs.out");
f>>n;
for(i=1;i<=n;i++)
f>>m[i];
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
{a=m[i];b=m[j]; t=0;
for(d=2;d<=a && t==0; d++)
while(a%d==0 && t==0)
{a/=d;
if(b%d==0) t=1;}
if(t==0) nr++;
}
g<<nr<<'\n';
f.close();
g.close();
return 0;
}