Cod sursa(job #109768)
| Utilizator | Data | 25 noiembrie 2007 12:40:06 | |
|---|---|---|---|
| Problema | Pairs | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | preONI 2008, Runda 1, Clasa a 10-a | Marime | 0.43 kb |
#include<fstream.h>
long long n,m[100001],i,j,nr;
long long cmmdc(long long a,long long b)
{
if(a>b)
return cmmdc(a-b,b);
else
if(b>a)
return cmmdc(a,b-a);
else
return a;
}
int main()
{
ifstream f("pairs.in");
ofstream g("pairs.out");
f>>n;
for(i=1;i<=n;i++)
f>>m[i];
for(i=1;i<=n-1;i++)
{
for(j=i+1;j<=n;j++)
if(cmmdc(m[i],m[j])==1)
nr++;
}
g<<nr;
return 0;
}