Cod sursa(job #109598)
Utilizator | Flestea Florin flesteaf | Data | 25 noiembrie 2007 12:01:38 |
---|---|---|---|
Problema | Pairs | Scor | 0 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 1, Clasele 11-12 | Marime | 0.4 kb |
#include <fstream.h>
int prim(int i,int j)
{int k;
for(k=2;k<=i/2;++k)
if(i%k==0&&j%k==0) return 0;
if((i%j==0)||(j%i==0)) return 0;
return 1;
}
int main()
{int n,m[32000],nr=0,i,j;
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]) if(prim(m[i],m[j])) nr++;
g<<nr;
return 0;
}