Cod sursa(job #109336)
Utilizator | Pajarcu Alexandru-Petrisor petre | Data | 25 noiembrie 2007 10:18:27 |
---|---|---|---|
Problema | Pairs | Scor | 30 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 1, Clasele 11-12 | Marime | 0.48 kb |
#include <stdio.h>
int a[100000],n,i,j,k,l;
int cmmdc(int x,int y)
{ int b;
if ( x % y==0) b=y;
else b=cmmdc(y, x % y);
return(b);
}
int main()
{
freopen("pairs.in","r",stdin);
freopen("pairs.out","w",stdout);
scanf("%d",&n);
for (i=1;i<n+1;++i) scanf("%d",& a[i]);k=0;
for (i=1;i<n;++i)
for (j=i+1;j<n+1;++j)
if (a[i]<a[j]) if(cmmdc(a[j],a[i])==1) k+=1;
else; else if(cmmdc(a[i],a[j])==1) k+=1;
printf("%d",k);
fcloseall;
return(0);
}