Cod sursa(job #114096)
Utilizator | Catalina Predoi hazegirl | Data | 12 decembrie 2007 17:32:32 |
---|---|---|---|
Problema | Pairs | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
//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++)
{a=m[i]; b=m[j];
t=0;
for(d=2;d<=a && t==0; d++)
{if(a%d==0 && b%d==0) t=1;
while(a%d==0)
a/=d;}
if(t==0) nr++;
}
g<<nr<<'\n';
f.close();
g.close();
return 0;
}