Cod sursa(job #109291)
Utilizator | Costica Vlad dj_vladootz | Data | 25 noiembrie 2007 09:59:08 |
---|---|---|---|
Problema | Pairs | Scor | 0 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 1, Clasele 11-12 | Marime | 0.47 kb |
#include<fstream.h>
int v[1000],n,p=0;
ifstream citeste ("pairs.in");
ofstream scrie ("pairs.out");
int prime (int a,int b)
{
while (a!=b)
if (a>b) a-=b;
else b-=a;
if (a>1) return 0;
else return 1;
}
int pairs (int a,int b)
{
int x;
if (a==b) return 0;
x=prime (a,b);
return x;
}
int main ()
{
citeste>>n;
for (int i=1;i<=n;i++) citeste>>v[i];
for (i=1;i<n;i++)
for (int j=i;j<=n;j++)
if (pairs (v[i],v[j])) p++;
scrie<<p;
return 0;
}