Cod sursa(job #194885)
Utilizator | wiz kid luckyme91 | Data | 14 iunie 2008 23:43:44 |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream.h>
#include<math.h>
long n,v[100000];
long prim(int a,int b)
{ if(a==1)return 1;
else {if(a==0)return 0;
else {
if(a>b) prim(a%b,b);
else prim(b%a,a);
}
}
}
int main()
{ ifstream f("pairs.in");
ofstream g("pairs.out");
long nr=0,i,j;
f>>n;
for (i=1;i<=n;i++) f>>v[i];
f.close();
for (i=1;i<=n-1;i++)
for (j=i+1;j<=n;j++) if(prim (v[i],v[j])==1)nr++;
g<<nr;
g.close();return 0;}