Cod sursa(job #2676722)
| Utilizator | Data | 24 noiembrie 2020 20:56:49 | |
|---|---|---|---|
| Problema | Pairs | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("pairs.in");
ofstream fout("pairs.out");
int n, perechi, v[100005];
int main() {
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
for (int j = 1; j < i; ++j) {
if (v[j] != v[i] && __gcd(v[j], v[i]) == 1)
++perechi;
}
}
fout << perechi;
return 0;
}
