1 条题解

  • 0
    @ 2025-10-13 12:55:17

    #include <bits/stdc++.h> using namespace std;

    int main() { int n; cin >> n; int nums[501]; for (int i = 1; i <= n; ++i) { cin >> nums[i]; } int odd_nums[501]; int odd_count = 0; for (int i = 1; i <= n; ++i) { if (nums[i] % 2 == 1) { odd_count++; odd_nums[odd_count] = nums[i]; } } sort(odd_nums + 1, odd_nums + odd_count + 1); for (int i = 1; i <= odd_count; ++i) { if (i > 1) { cout << ","; } cout << odd_nums[i]; } cout << endl; return 0; }

    信息

    ID
    243
    时间
    1000ms
    内存
    256MiB
    难度
    3
    标签
    递交数
    62
    已通过
    35
    上传者