Cod sursa(job #109304)
Utilizator | Adrian David ady.david | Data | 25 noiembrie 2007 10:06:19 |
---|---|---|---|
Problema | Pairs | Scor | 0 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 1, Clasa a 10-a | Marime | 0.56 kb |
#include<fstream.h>
#include<conio.h>
ifstream fin("pairs.in");
ofstream fout("pairs.out");
int prim(long x, long y)
{
int m=2,w=1;
long a,b;
if (a>=b) { a=x; b=y;}
else {a=y; b=x;}
while((m<=a)&&(w==1))
{
if((a%m!=0)||(b%m!=0)) m++;
else w=0;
}
if((a%m==0)&&(b%m==0)) return 0;
else return 1;
}
int main()
{
long v[100000],i,j,n,k=0;
fin>>n;
for(i=0;i<n;i++) fin>>v[i];
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++) if(prim(v[i],v[j])) k++;
}
fout<<k;
}