巧用algorithm库简化奇偶分离程序

```cpp #include <iostream> #include <algorithm> const int MAXN = 105; int n, a[MAXN]; bool isOdd(int x) { return x % 2 != 0; } int main() { std::cin >> n; for (int i = 0; i < n; ++i) { std::cin >> a[i]; } std::partition(a, a + n, isOdd); for (int i = 0; i < n; ++i) { if (isOdd(a[i])) std::cout << a[i] << " "; } std::cout << std::endl; for (int i = 0; i < n; ++i) { if (!isOdd(a[i])) std::cout << a[i] << " "; } return 0; } ``` ######[AI问答 | 223点数解答 | 2026-05-16 19:28:13]