Cod sursa(job #109568)
| Utilizator | Data | 25 noiembrie 2007 11:56:18 | |
|---|---|---|---|
| Problema | Pairs | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | preONI 2008, Runda 1, Clasa a 10-a | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin("pairs.in");
ofstream fout("pairs.out");
long n, k, a[100001];
int cmmdc(int , int);
int main()
{
int i, j;
fin>>n;
for(i=1; i<=n; i++)
{
fin>>a[i];
for(j=1; j<i; j++)
{
if(cmmdc(a[i], a[j])==1)
k++;
}
}
fout<<k<<"\n";
return 0;
}
int cmmdc(int i, int j)
{
while(i!=j)
{
if(i>j)
i-=j;
else
j-=i;
}
return i;
}
