Cod sursa(job #2577383)
Utilizator | Ciocoiu Vlad vlad082002 | Data | 9 martie 2020 10:09:11 |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("pairs.in");
ofstream fout("pairs.out");
int v[100005], n, res;
int gcd(int a, int b) {
if(b == 0)
return a;
return gcd(b, a%b);
}
void citire() {
fin >> n;
for(int i = 1; i <= n; i++)
fin >> v[i];
}
void solve() {
for(int i = 1; i <= n; i++)
for(int j = i+1; j <= n; j++)
if(gcd(v[i], v[j]) == 1)
res++;
fout << res;
}
int main() {
citire();
solve();
}