白帽子红帽子问题:厅内有 5 个人,他们均戴着帽子,有白帽子和红帽子。已知戴白帽子的说真话,戴红帽子的说假话,他们的说法如下:
甲:我看见一个戴白帽子的
乙:我没有看见戴红帽子的
丙:我看见一个戴白帽子的,但不是甲
丁:我没有看见戴白帽子的
戊:我的帽子和丙一样
请从他们各自提供的线索辨别谁戴白帽子,谁戴红帽子,需要利用蛮力法设计算法求解问题。
代码如下:
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<istream>
#include<iomanip>
#include<ostream>
#include<list>
#include<vector>
#include<set>
#include<map>
#include<fstream>
#include<stack>
#include<ctime>
#include<deque>
#include<queue>
#include <sstream>
#include <numeric>
#pragma warning (disable:4996)
using namespace std;
int main()
{
int c1, c2, c3, c4, c5;
for (int a = 0; a <= 1; a++)
for (int b = 0; b <= 1; b++)
for (int c = 0; c <= 1; c++)
for (int d = 0; d <= 1; d++)
for (int e = 0; e <= 1; e++)
{
c1 = ((b + c + d + e) == 1) == a;
c2 = ((a + c + d + e) == 4) == b;
c3 = ((b + d + e) == 1) == c;
c4 = ((a + b + c + e) == 0) == d;
c5 = (c == e) == e;
if (c1 && c2 && c3 && c4 && c5)
{
if (a == 1)
printf("甲戴帽子\n");
else
printf("甲戴红帽子\n");
if (b == 1)
printf("乙戴白帽子\n");
else
printf("乙戴红帽子\n");
if (c == 1)
printf("丙戴白帽子\n");
else
printf("丙戴红帽子\n");
if (d == 1)
printf("丁戴白帽子\n");
else
printf("丁戴红帽子\n");
if (e == 1)
printf("戊戴白帽子\n");
else
printf("戊戴红帽子\n");
}
}
}