Cod sursa(job #2436798)
Utilizator | Data | 7 iulie 2019 11:31:44 | |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("pairs.in");
ofstream fout("pairs.out");
int n, v[100007], contor;
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) ++contor;
}
}
fout << contor;
fin.close();
fout.close();
return 0;
}