1.4工作安排问题
先对约束关系进行分析
//要求解出所有可能的安排，需要对每一种可能做print
int A, B, C, D, E, F;
cout << "A B C D E F"<<endl;
A = 0;B = 0;C = 0;D = 0;E = 0;F = 0;
//0 means go to, 1 means don't go
//从B开始
for (B == 0;B <= 1;B++) {
if (B == 0) {//第一种可能，B不去
A = 1, C = 0, D = 1;
for (;E <= 1;E++) {
if (E == 0) {
F = 1;
cout << A <<" " << B << " " << C << " " << D << " " << E << " " << F << endl;
}
else {
F = 0;
cout << A << " " << B << " " << C << " " << D << " " << E << " " << F << endl;
}
}
}
else {
A = 0, C = 1, E = 1, F = 1, D = 0;
cout << A << " " << B << " " << C << " " << D << " " << E << " " << F << endl;
}
}bb1a84a5-4ea1-4607-bb14-af67e9241fe1
