Cod sursa(job #3264528)
Utilizator | Data | 22 decembrie 2024 10:52:23 | |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("pairs.in");
ofstream g("pairs.out");
int n,v[100005],cnt;
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(__gcd(v[i],v[j])==1)
cnt++;
g<<cnt;
return 0;
}