Pagini recente » Cod sursa (job #1600009) | Cod sursa (job #926882) | Cod sursa (job #3159029) | Cod sursa (job #2352654) | Cod sursa (job #3306321)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("pairs.in");
ofstream fout("pairs.out");
const int NMAX = 100001;
int n;
int v[NMAX];
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
{
fin >> v[i];
}
int ans = 0;
for(int i = 1; i < n; i++)
{
for(int j = i + 1; j <= n; j++)
{
int g = __gcd(v[i], v[j]);
if((v[i] != v[j]) && (g == 1))
{
ans++;
}
}
}
fout << ans;
return 0;
}