Pagini recente » Cod sursa (job #1849250) | Cod sursa (job #215323) | Cod sursa (job #3157187) | Cod sursa (job #930034) | Cod sursa (job #112760)
Cod sursa(job #112760)
#include<fstream.h>
ifstream f("pairs.in");
ofstream g("pairs.out");
int x,a[100000],i,j,k;
int euclid(int p,int q)
{
while(q)
{int r=p%q;
p=q;
q=r;
}
return p;
}
int main()
{
f>>x;
for(i=1;i<=x;i++)
f>>a[i];
for(i=1;i<x;i++)
for(j=i+1;j<=x;j++)
if(a[i]%a[j]||a[j]%a[i]||(a[i]%2==0&&a[j]%2==0))
if(euclid(a[i],a[j])==1)
k++;
g<<k;
return 0;
}