Pagini recente » Cod sursa (job #544573) | Cod sursa (job #2542118) | Cod sursa (job #1616821) | Cod sursa (job #1912126) | Cod sursa (job #113446)
Cod sursa(job #113446)
#include<stdio.h>
#include<math.h>
FILE *f1,*f2;
long int cmmdc(long int a, long int b)
{long int c;
if(a*b==0)
c=a+b;
else{
while (a!=b)
if(a>b)a=a-b; else b=b-a;
c=a;}
return c;}
int main()
{long int a[200],n,i,j,np;
f1=fopen("pairs.in","r");
fscanf(f1,"%li\n",&n);
for(i=0;i<n;i++)
fscanf(f1,"%li\n",&a[i]);
fclose(f1);
np=0;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(cmmdc(a[i],a[j])==1)np++;
f2=fopen("pairs.out","w");
fprintf(f2,"%li",np);
fclose(f2);
return 0;
}