Cod sursa(job #109712)
Utilizator | Oltean Dorin Dorin | Data | 25 noiembrie 2007 12:32:00 |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 1, Clasele 11-12 | Marime | 0.6 kb |
# include <stdio.h>
# define input "pairs.in"
# define output "pairs.out"
# define max 100001
long n,i,j,rez,a[max];
int prime(long a,long b)
{
int r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a==1?1:0;
}
int main()
{
freopen(input,"r",stdin);
freopen(output,"w",stdout);
scanf("%ld",&n);
for(i=1;i<=n;i++)
scanf("%ld",&a[i]);
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
if(prime(a[i],a[j]))
rez++;
printf("%ld",rez);
return 0;
}