摘要： C. Odd One Subsequence 开个桶来统计每种数的个数，答案就是 \(\sum \binom{cnt[x]}{2} \times (n-cnt[x])\) 代码实现 #include <bits/stdc++.h> #define rep(i, n) for (int i = 0; 阅读全文