Cod sursa(job #3306321)
| Utilizator | Data | 9 august 2025 17:15:04 | |
|---|---|---|---|
| Problema | Pairs | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#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;
}