Cod sursa(job #235007)
Utilizator | Cebere Bogdan Bogdan_C | Data | 22 decembrie 2008 14:17:19 |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include<cstdio>
using namespace std;
int euclid(int a,int b)
{if(b==0) return a;
else {int r=1,d;
while(r!=0)
{r=a%b;
d=euclid(b,r);
return d;
}
}
}
int main()
{freopen("pairs.in","r",stdin);
freopen("pairs.out","w",stdout);
int n,a[100001];
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
int nr=0;
for(int i=1;i<=n;i++)
{for(int j=i+1;j<=n;j++)
if(euclid(a[i],a[j])==1) nr++;
}
printf("%d",nr);
return 0;}