Cod sursa(job #2501206)
Utilizator | Magirescu Tudor Frostfire | Data | 29 noiembrie 2019 11:23:11 |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | simu | Marime | 0.45 kb |
#include <fstream>
#include <iostream>
#define NMAX 100000
using namespace std;
ifstream f("pairs.in");
ofstream g("pairs.out");
int n, sol, v[NMAX+10];
int cmmdc(int a, int b)
{
if(!b) return a;
return cmmdc(b, a%b);
}
int main()
{
f >> n;
for(int i=1; i<=n; i++) f >> v[i];
for(int i=1; i<n; i++)
for(int j=i+1; j<=n; j++) if(cmmdc(v[i], v[j]) == 1) sol++;
g << sol << '\n';
return 0;
}