思路分析:
每个人总共五种可能,一共五个人,所有总共25种情况
解题重点:
条件1+条件2==1;代表两个条件只有一个为真
查重的方法:分别将1左移数组中的元素位,再或等运算,相当于把那一位置为一,如果在之后那一位已经是1,说明重复
代码示例:
#include<stdio.h>
#include <stdlib.h>
int chachong(int * player,int n)
{
int i,res = 0;
for (i = 0; i < n; ++i)
{
res |= 1 << player[i];
}
return res == 0x3e;
}
int main()
{
int player[5] = { 0 };
for (player[0] = 1; player[0] <= 5; player[0]++)
{
for (player[1] = 1; player[1] <= 5; player[1]++)
{
for (player[2] = 1; player[2] <= 5; player[2]++)
{
for (player[3] = 1; player[3] <= 5; player[3]++)
{
for (player[4] = 1; player[4] <= 5; player[4]++)
{
if ((player[0] == 3) + (player[1] == 2) == 1 &&
(player[1] == 2) + (player[4] == 4) == 1 &&
(player[2] == 1) + (player[3] == 2) == 1 &&
(player[2] == 5) + (player[3] == 3) == 1 &&
(player[4] == 4) + (player[0] == 1) == 1 &&
chachong(player, 5))
{
printf("%d %d %d %d %d", player[0], player[1], player[2], player[3], player[4]);
}
}
}
}
}
}
system("pause");
return 0;
}