Cod sursa(job #194841)
Utilizator | wiz kid luckyme91 | Data | 14 iunie 2008 19:59:11 |
---|---|---|---|
Problema | Pairs | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include<iostream.h>
#include<fstream.h>
fstream f("pairs.in",ios::in),g("pairs.out",ios::out);
long prim(int a,int b){
if(a==0)return 0;
else if(a==1)return 1;
if(a>b) prim(a-b,b);
else prim(b-a,a);}
void main(){
long n,nr,v[10000],i,j;
nr=0;
f>>n;
for(i=1;i<=n;i++)f>>v[i];
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)if(prim(v[i],v[j])==1)nr++;
g<<nr;}