Cod sursa(job #109457)
| Utilizator | Data | 25 noiembrie 2007 11:11:05 | |
|---|---|---|---|
| Problema | Pairs | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | preONI 2008, Runda 1, Clasele 11-12 | Marime | 0.48 kb |
#include<stdio.h>
#define N 100000
int n,m,v[N],nr;
void read()
{
int i;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
}
int cmmdc(int a,int b)
{
int r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
void solve()
{
int i,j;
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(cmmdc(v[i],v[j])==1)
nr++;
printf("%d\n",nr);
}
int main()
{
freopen("pairs.in","r",stdin);
freopen("pairs.out","w",stdout);
read();
solve();
return 0;
}
