Pagini recente » Cod sursa (job #1367403) | Cod sursa (job #105961) | Cod sursa (job #1949472) | Cod sursa (job #1852327) | Cod sursa (job #114094)
Cod sursa(job #114094)
//pairs
#include<fstream.h>
int main()
{long int n, m[100001],i,j,nr=0,t,a,b,d;
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++)
{if(m[i]<m[j]) {a=m[i];b=m[j];}
else {a=m[j];b=m[i];}
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;
}