#include <stdio.h> int main()
{
int a = 0;
int b = 0;
int c = 0;
int d = 0;
int e = 0;
int n = 0;
int flag = 0;
for(a = 1; a<=5; a++)
{
for(b = 1; b<=5; b++)
{
for(c = 1; c<=5; c++)
{
for(d = 1; d<=5; d++)
{
for(e = 1; e<=5; e++)
{
if(((b==1)+(a==3)==1) //每个人的话只有半句是真的
&&((b==2)+(e==4)==1)
&&((c==1)+(d==2)==1)
&&((c==5)+(d==3)==1)
&&((e==4)+(a==1)==1))
{
//flag = 0;
n |= (1<<(a-1));
n |= (1<<(b-1)); // 左移一位与0按位或
n |= (1<<(c-1));
n |= (1<<(d-1));
n |= (1<<(e-1));
if(n==1||n==3||n==7||n==15||n==31)
printf("a = %d b = %d c = %d d = %d e = %d\n",a,b,c,d,e);
n=0;
}
}
}
}
}
}
return0;
}
1.杨辉三角问题#include <stdio.h>#include <stdlib.h>const int length = 10; // 确定杨辉三角的高度 int main(){ int nums[length][length]; int i, j; //计算 for(i=0; i<length; i++) { nums[i][0