题解 | #最简真分数#
最简真分数
https://www.nowcoder.com/practice/1f1db273eeb745c6ac83e91ff14d2ec9
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
while (cin >> n){
vector<int> a;
for (int i=0; i<n; i++){
int tmp;
cin >> tmp;
a.push_back(tmp);
}
sort(a.begin(), a.end());
int cnt = 0;
for (int i=0; i<n; i++){
for(int j=i+1; j<n; j++){
if (__gcd(a[i], a[j]) == 1){
cnt ++;
}
}
}
cout << cnt << endl;
}
return 0;
}
查看16道真题和解析