超常规解法

有用请点个赞！！！

#include <bits/stdc++.h>
using namespace std;
int j[35],o[35],n,ol = 1,jl = 1;
int main()
{
    cin >> n;
    for(int i = 1;i <= n;i ++)
    {
        int num;
        cin >> num;
        if(num % 2 == 0)
        {
            o[ol] = num;
            ol ++;
        }
        else
        {
            j[jl] = num;
            jl ++;
        }
    }
    for(int i = 1;i < jl;i ++)
    {
        cout << j[i] << " ";
    }
    cout << endl;
    for(int i = 1;i < ol;i ++)
    {
        cout << o[i] << " ";
    }
    return 0;
}