Cod sursa(job #2972173)
Utilizator | Data | 28 ianuarie 2023 19:09:02 | |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("pairs.in");
ofstream fout("pairs.out");
int a[100001];
int gcd(int a, int b)
{
return b == 0 ? a : gcd(b, a % b);
}
int main(){
int n,cnt=0;
fin>>n;
for(int i=1;i<=n;i++){
fin>>a[i];
}
for(int i=1;i<n;i++){
for(int j=i+1;j<=n;j++)
if(gcd(a[i],a[j])==1)
cnt++;
}
fout<<cnt;
return 0;
}