Cod sursa(job #2515871)
Utilizator | Data | 29 decembrie 2019 17:48:04 | |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("pairs.in");
ofstream out("pairs.out");
const int lim=1e5+3;
int v[lim];
int main()
{
int n;
long long int cnt=0;
in>>n;
for(int i=1;i<=n;++i)
in>>v[i];
for(int i=1;i<=n-1;++i)
for(int j=i+1;j<=n;++j)
if(__gcd(v[i],v[j])==1)
++cnt;
out<<cnt;
return 0;
}