Cod sursa(job #3348206)
| Utilizator | Data | 20 martie 2026 10:28:41 | |
|---|---|---|---|
| Problema | Pairs | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("pairs.in");
ofstream fout("pairs.out");
int n;
int v[100004];
int main(){
fin >> n;
for(int i = 1; i <= n; i++){
fin >> v[i];
}
int nr = 0;
for(int i = 1; i < n; i++){
for(int j = i+1; j <= n; j++){
if(__gcd(v[i], v[j]) == 1){
nr++;
}
}
}
fout << nr;
return 0;
}
