Pagini recente » Cod sursa (job #2012149) | Clasament | Cod sursa (job #2019751) | Cod sursa (job #1567213) | Cod sursa (job #157084)
Cod sursa(job #157084)
#include<stdio.h>
#define M 100000
long v[M];
int main()
{long n,i,j,k,a,b,r;
FILE *f=fopen("pairs.in","r");
FILE *g=fopen("pairs.out","w");
fscanf(f,"%ld",&n);
for(i=1;i<=n;i++)
fscanf(f,"%ld",&v[i]);
k=0;
for(i=1;i<=n-1;i++)
if(v[i]==2) {for(j=i+1;j<=n;j++)
if(v[j]%2==1) k++;}
else {for(j=i+1;j<=n;j++)
if(v[j]!=2) {a=v[i];
b=v[j];
r=a%b;
while(r!=0)
{a=b;
b=r;
r=a%b;
}
if(b==1) k++;
}
}
fprintf(g,"%ld",k);
fprintf(g,"\n");
fclose(f);
fclose(g);
return 0;
}