幸运儿（数组）

解题思路:

注意事项:

参考代码:

#include<bits/stdc++.h>
using namespace std;
int n;
bool flag[100];
bool f()
{
    int num=0;
    for(int i=1;i<=n;i++){
        if(flag[i]==1)num++;
    }
    if(num==2)return 1;
    return 0;
}
int main()
{
    
    int t;
    while(cin>>n){
        for(int i=1;i<=n;i++){
            flag[i]=1;
        }
        t=0;
        while(f()!=1){
            t = 0;
            for(int i=1;i<=n;i++)
            {
                if(flag[i])
                    {
                        if(t==1)
                        {
                            flag[i]=0;
                            cout << i << " ";
//                            for(int j=1;j<=n;j++){
//                                cout << flag[i] << " ";
//                            }
//                            cout << endl;
                            t=0;
                        }
                        else t=1;
                    }
//                if(f()!=1){
//                    break;
//                }
            }
        }
        cout << endl;
        for(int i=1;i<=n;i++)
        {
            if(flag[i])cout << i << " ";
        }
        cout << endl;
    }
    
    return 0;
}