Cod sursa(job #3282979)
Utilizator | Data | 7 martie 2025 18:53:16 | |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | oji_go_11_12 | Marime | 0.39 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("pairs.in");
ofstream fout("pairs.out");
int n, v[100001], cnt;
int main(){
fin >> n;
for(int i = 1; i <= n; i++)
fin >> v[i];
for(int i = 1; i < n; i++){
for(int j = i + 1; j <= n; j++){
if(__gcd(v[i], v[j]) == 1)
cnt++;
}
}
fout << cnt;
}