Pagini recente » Cod sursa (job #419596) | Statistici Andrei (Fr0zeNN) | Cod sursa (job #930261) | Borderou de evaluare (job #3168119) | Cod sursa (job #1048639)
#include <iostream>
#include <fstream>
using namespace std;
int n,v[100],i,j,k;
ifstream f("pairs.in");
ofstream g("pairs.out");
int cmmdc(int a,int b)
{while(a!=b)
if(a>b)a-=b;
else b-=a;
return a;
}
int main()
{
f>>n;
for(i=1;i<=n;i++)f>>v[i];
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
if(cmmdc(v[i],v[j])==1&&v[i]!=v[j])k++;
g<<k;
return 0;
}