Pagini recente » Cod sursa (job #2209323) | Cod sursa (job #1482409) | Cod sursa (job #2699125) | Cod sursa (job #910722) | Cod sursa (job #109562)
Cod sursa(job #109562)
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
FILE*f=fopen("pairs.in","r");
FILE*g=fopen("pairs.out","w");
long n,a[100002];
void read()
{
fscanf(f,"%ld",&n);
for(long i=1;i<=n;++i) fscanf(f,"%ld",&a[i]);
}
long minim(long a, long b)
{
if(a==2) return b;
if(b==2) return a;
if(a>b) return b;
else return a;
}
void solve()
{
long sol=0,min,p;
long i,j,ok;
for(i=1;i<n;++i)
for(j=i+1;j<=n;++j)
{
min=minim(a[i],a[j]);
ok=1;
if(min%a[i]==0&&min%a[j]==0) ok=0;
else
for(p=2;p<=min/2;++p)
{
if(a[i]%p==0&&a[j]%p==0) { ok=0; break;}
}
if(ok==1)sol++;
}
fprintf(g,"%ld",sol);
}
int main()
{
read();
solve();
return 0;
}