Cod sursa(job #109529)
Utilizator | Paicu Alexandru rethos | Data | 25 noiembrie 2007 11:37:26 |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 1, Clasa a 10-a | Marime | 0.41 kb |
#include <fstream.h>
long a[10001],n;
long cmmdc(long x,long y)
{ long r=x%y;
while (r!=0)
{ x=y;
y=r;
r=x%y;
}
return y;
}
int main()
{ long i,j;
long long nr=0;
ifstream f("pairs.in");
f>>n;
for (i=1;i<=n;i++)
f>>a[i];
f.close();
for (i=1;i<n;i++)
for (j=i+1;j<=n;j++)
if (cmmdc(a[i],a[j])==1)
{ nr++;
}
ofstream g("pairs.out");
g<<nr;
return 0;
}