出行安排

/*
 * 就说有一个探险队，共有ABCDEF六名成员，他们出行条件如下：
 *  1. A和B两人中至少去一人
 *  2. A和D不能一起去
 *  3. AEF三个人中要派两个人去
 *  4. B和C都去或都不去
 *  5. C和D两人中去一个
 *  6. D去E就去，D不去E也不去
 * 问：应当让哪些人去？
 */
#include <iostream>

using namespace std;

enum {A=0,B,C,D,E,F};
int main()
{
    char Team[6][3] = {{'A',2},{'B',2},{'C',2},{'D',2},{'E',2},{'F',2}};
    int i=1;
    while(i>=0)
    {
        Team[A][1] = i;
        if(Team[A][1] == 1)
        {
            Team[D][1] = 0;
            Team[E][1] = Team[D][1];
            Team[C][1] = 1-Team[D][1];
            Team[B][1] = Team[C][1];
        }
        else
        {
            Team[B][1] = 1;
            Team[C][1] = Team[B][1];
            Team[D][1] = 1-Team[C][1];
            Team[E][1] = Team[D][1];
        }
        Team[F][1] = 2-Team[A][1]-Team[E][1];
        if(Team[F][1] != 2)
        {
            cout<<"方案"<<endl;
            for(int j=A;j<=F;j++)
            {
                if(Team[j][1] == 1)
                {
                    cout<< Team[j][0]<<"--";
                }
            }
            cout<<endl;
        }
        i--;

    }

    return 0;
}