今年早些时候,这张图片火遍了网络,当时就想着,这个题目用计算机来解,应该是很方便的。无奈当时工作忙,没有时间弄。最近时间闲,就鼓捣了一下,花费几个小时,成功运行得出答案。但上网一看,各路大神早就给出了N种解法。其中找到一篇和我一样用暴力穷举实现的。我的解法和他的相比,区别在:我穷举所有答案时,是用递归算法实现的。再和另一篇C语言解法作者比较,他是用进位的思想遍历所有答案,节省的是存储空间。而我是一开始就把答案列出来,用空间换时间;在我自己的电脑上运行,速度比他的程序快3倍左右。
思路:
1.构建一个答案集,囊括所有答案,有4^10种,共1048576个,编号从0编到1048575。
2.将每个题目看作一个命题,把命题的选项作为参数,定义10个判断函数,如果选项正确,函数就返回真值。
3.从编号0开始判断到1048576,发现一个正确答案就将编号压栈,最后将所有正确答案打印出来。
废话少说上代码:
#include<stdio.h>
#define BOOL char
#define TRUE 1
#define FALSE 0
struct answer{ //定义答案结构,answer下标从0-9代表1-10题的答案
char index[10];
};
void init_answer_set(struct answer* answer_set,int low,int high,int indexNum){//初始化答案数组函数,递归算法构造所有答案的数组。low和high代表答案编号范围。
int area = (high-low +1)/4;
int i;
if (indexNum==9){
for(i=0;i<4;i++){
answer_set[low+i].index[indexNum]='a'+i;
}
}else{
for(i=0;i<area;i++){
answer_set[low+i].index[indexNum]='a';
answer_set[low+area+i].index[indexNum]='b';
answer_set[low+area*2+i].index[indexNum]='c';
answer_set[low+area*3+i].index[indexNum]='d';
}
init_answer_set(answer_set,low,low+area-1,indexNum+1);
init_answer_set(answer_set,low+area,low+area*2-1,indexNum+1);
init_answer_set(answer_set,low+area*2,low+area*3-1,indexNum+1);
init_answer_set(answer_set,low+area*3,low+area*4-1,indexNum+1);
}
}
int printf_answer(struct answer* answer_set,int num){ //定义打印函数,参数num,打印编号为num的答案
int i;
if(num>=1048576||num<0){
printf("答案编号输入错误\n");
return 0;
}
printf("这是第%d个答案\n",num);
for(i=0;i<10;i++){
printf("%c\t",answer_set[num].index[i]);
}
printf("\n");
return 1;
}
BOOL question0(struct answer* answer_set,int num){//第一题的命题判断函数 ,虽然没什么信息量,本来可以不写,但为了代码看起来整齐,不缺斤少两,还是写上吧。
if(num>=1048576||num<0){
printf("答案编号输入错误\n");
return 0;
} else if (answer_set[num].index[0]<97||answer_set[num].index[0]>100){
printf("答案选项输入错误\n");
return 0;
}//输入检查
if(answer_set[num].index[0]=='a'){//答案为a时
if(answer_set[num].index[0]=='a') return 1;
else return 0;
}
if(answer_set[num].index[0]=='b'){//答案为b时
if(answer_set[num].index[0]=='b') return 1;
else return 0;
}
if(answer_set[num].index[0]=='c'){//答案为c时
if(answer_set[num].index[0]=='c') return 1;
else return 0;
}
if(answer_set[num].index[0]=='d'){//答案为d时
if(answer_set[num].index[0]=='d') return 1;
else return 0;
}
}
BOOL question1(struct answer* answer_set,int num){//第二题的命题判断函数
if(num>=1048576||num<0){
printf("答案编号输入错误\n");
return 0;
} else if (answer_set[num].index[1]<97||answer_set[num].index[1]>100){
printf("答案选项输入错误\n");
return 0;
}//输入检查
if(answer_set[num].index[1]=='a'){//答案为a时
if(answer_set[num].index[4]=='c') return 1;
else return 0;
}
if(answer_set[num].index[1]=='b'){//答案为b时
if(answer_set[num].index[4]=='d') return 1;
else return 0;
}
if(answer_set[num].index[1]=='c'){//答案为c时
if(answer_set[num].index[4]=='a') return 1;
else return 0;
}
if(answer_set[num].index[1]=='d'){//答案为d时
if(answer_set[num].index[4]=='b') return 1;
else return 0;
}
}
BOOL question2(struct answer* answer_set,int num){//第三题的命题判断函数
if(num>=1048576||num<0){
printf("答案编号输入错误\n");
return 0;
} else if (answer_set[num].index[2]<97||answer_set[num].index[2]>100){
printf("答案选项输入错误\n");
return 0;
}//输入检查
if(answer_set[num].index[2]=='a'){//答案为a时
if(answer_set[num].index[5]==answer_set[num].index[1]&&answer_set[num].index[5]==answer_set[num].index[3]&&answer_set[num].index[2]!=answer_set[num].index[5]) return 1;
else return 0;
}
if(answer_set[num].index[2]=='b'){//答案为b时
if(answer_set[num].index[2]==answer_set[num].index[1]&&answer_set[num].index[2]==answer_set[num].index[3]&&answer_set[num].index[5]!=answer_set[num].index[2]) return 1;
else return 0;
}
if(answer_set[num].index[2]=='c'){//答案为c时
if(answer_set[num].index[2]==answer_set[num].index[5]&&answer_set[num].index[2]==answer_set[num].index[3]&&answer_set[num].index[1]!=answer_set[num].index[2]) return 1;
else return 0;
}
if(answer_set[num].index[2]=='d'){//答案为d时
if(answer_set[num].index[2]==answer_set[num].index[5]&&answer_set[num].index[2]==answer_set[num].index[1]&&answer_set[num].index[3]!=answer_set[num].index[2]) return 1;
else return 0;
}
}
BOOL question3(struct answer* answer_set,int num){//第四题的命题判断函数
if(num>=1048576||num<0){
printf("答案编号输入错误\n");
return 0;
} else if (answer_set[num].index[3]<97||answer_set[num].index[3]>100){
printf("答案选项输入错误\n");
return 0;
}//输入检查
if(answer_set[num].index[3]=='a'){//答案为a时
if(answer_set[num].index[0]==answer_set[num].index[4]) return 1;
else return 0;
}
if(answer_set[num].index[3]=='b'){//答案为b时
if(answer_set[num].index[1]==answer_set[num].index[6]) return 1;
else return 0;
}
if(answer_set[num].index[3]=='c'){//答案为c时
if(answer_set[num].index[0]==answer_set[num].index[8]) return 1;
else return 0;
}
if(answer_set[num].index[3]=='d'){//答案为d时
if(answer_set[num].index[5]==answer_set[num].index[9]) return 1;
else return 0;
}
}
BOOL question4(struct answer* answer_set,int num){//第五题的命题判断函数
if(num>=1048576||num<0){
printf("答案编号输入错误\n");
return 0;
} else if (answer_set[num].index[4]<97||answer_set[num].index[4]>100){
printf("答案选项输入错误\n");
return 0;
}//输入检查
if(answer_set[num].index[4]=='a'){//答案为a时
if(answer_set[num].index[4]==answer_set[num].index[7]) return 1;
else return 0;
}
if(answer_set[num].index[4]=='b'){//答案为b时
if(answer_set[num].index[4]==answer_set[num].index[3]) return 1;
else return 0;
}
if(answer_set[num].index[4]=='c'){//答案为c时
if(answer_set[num].index[4]==answer_set[num].index[8]) return 1;
else return 0;
}
if(answer_set[num].index[4]=='d'){//答案为d时
if(answer_set[num].index[4]==answer_set[num].index[6]) return 1;
else return 0;
}
}
BOOL question5(struct answer* answer_set,int num){//第六题的命题判断函数
if(num>=1048576||num<0){
printf("答案编号输入错误\n");
return 0;
} else if (answer_set[num].index[5]<97||answer_set[num].index[5]>100){
printf("答案选项输入错误\n");
return 0;
}//输入检查
if(answer_set[num].index[5]=='a'){//答案为a时
if(answer_set[num].index[7]==answer_set[num].index[1]&&answer_set[num].index[7]==answer_set[num].index[3]) return 1;
else return 0;
}
if(answer_set[num].index[5]=='b'){//答案为b时
if(answer_set[num].index[7]==answer_set[num].index[0]&&answer_set[num].index[7]==answer_set[num].index[5]) return 1;
else return 0;
}
if(answer_set[num].index[5]=='c'){//答案为c时
if(answer_set[num].index[7]==answer_set[num].index[2]&&answer_set[num].index[7]==answer_set[num].index[9]) return 1;
else return 0;
}
if(answer_set[num].index[5]=='d'){//答案为d时
if(answer_set[num].index[7]==answer_set[num].index[4]&&answer_set[num].index[7]==answer_set[num].index[8]) return 1;
else return 0;
}
}
BOOL isMin(struct answer* answer_set,int num,char option){//第七题判断函数 看字符答案option是否是最少选项,如果是,就返回1,否则返回0
int count_a=0;
int count_b=0;
int count_c=0;
int count_d=0;
int indexNum;
char min;
for (indexNum=0;indexNum<10;indexNum++){
if (answer_set[num].index[indexNum]=='a')
count_a=count_a+1;
else if(answer_set[num].index[indexNum]=='b')
count_b=count_b+1;
else if(answer_set[num].index[indexNum]=='c')
count_c=count_c+1;
else if(answer_set[num].index[indexNum]=='d')
count_d=count_d+1;
}
if (count_a<count_b&&count_a<count_c&&count_a<count_d)
min='a';
else if(count_b<count_a&&count_b<count_c&&count_b<count_d)
min='b';
else if(count_c<count_a&&count_c<count_b&&count_c<count_d)
min='c';
else if(count_d<count_a&&count_d<count_b&&count_d<count_c)
min='d';
else min=0;
if(option == min)
return 1;
else return 0;
}
BOOL question6(struct answer* answer_set,int num){//第七题的命题判断函数
if(num>=1048576||num<0){
printf("答案编号输入错误\n");
return 0;
} else if (answer_set[num].index[6]<97||answer_set[num].index[6]>100){
printf("答案选项输入错误\n");
return 0;
}//输入检查
if(answer_set[num].index[6]=='a'){//答案为a时
if(isMin(answer_set,num,'c')) return 1;
else return 0;
}
if(answer_set[num].index[6]=='b'){//答案为b时
if(isMin(answer_set,num,'b')) return 1;
else return 0;
}
if(answer_set[num].index[6]=='c'){//答案为c时
if(isMin(answer_set,num,'a')) return 1;
else return 0;
}
if(answer_set[num].index[6]=='d'){//答案为d时
if(isMin(answer_set,num,'d')) return 1;
else return 0;
}
}
BOOL question7(struct answer* answer_set,int num){//第八题的命题判断函数
if(num>=1048576||num<0){
printf("答案编号输入错误\n");
return 0;
} else if (answer_set[num].index[7]<97||answer_set[num].index[7]>100){
printf("答案选项输入错误\n");
return 0;
}//输入检查
if(answer_set[num].index[7]=='a'){//答案为a时
if((answer_set[num].index[6]-1!=answer_set[num].index[0])&&(answer_set[num].index[6]+1!=answer_set[num].index[0])) return 1;
else return 0;
}
if(answer_set[num].index[7]=='b'){//答案为b时
if((answer_set[num].index[4]-1!=answer_set[num].index[0])&&(answer_set[num].index[4]+1!=answer_set[num].index[0])) return 1;
else return 0;
}
if(answer_set[num].index[7]=='c'){//答案为c时
if((answer_set[num].index[1]-1!=answer_set[num].index[0])&&(answer_set[num].index[1]+1!=answer_set[num].index[0])) return 1;
else return 0;
}
if(answer_set[num].index[7]=='d'){//答案为d时
if((answer_set[num].index[9]-1!=answer_set[num].index[0])&&(answer_set[num].index[9]+1!=answer_set[num].index[0])) return 1;
else return 0;
}
}
BOOL question8(struct answer* answer_set,int num){//第九题的命题判断函数
if(num>=1048576||num<0){
printf("答案编号输入错误\n");
return 0;
} else if (answer_set[num].index[8]<97||answer_set[num].index[8]>100){
printf("答案选项输入错误\n");
return 0;
}//输入检查
if(answer_set[num].index[8]=='a'){//答案为a时
if((answer_set[num].index[0]==answer_set[num].index[5])!=(answer_set[num].index[5]==answer_set[num].index[4])) return 1;
else return 0;
}
if(answer_set[num].index[8]=='b'){//答案为b时
if((answer_set[num].index[0]==answer_set[num].index[5])!=(answer_set[num].index[9]==answer_set[num].index[4])) return 1;
else return 0;
}
if(answer_set[num].index[8]=='c'){//答案为c时
if((answer_set[num].index[0]==answer_set[num].index[5])!=(answer_set[num].index[1]==answer_set[num].index[4])) return 1;
else return 0;
}
if(answer_set[num].index[8]=='d'){//答案为d时
if((answer_set[num].index[0]==answer_set[num].index[5])!=(answer_set[num].index[8]==answer_set[num].index[4])) return 1;
else return 0;
}
}
int max_Minus_min(struct answer* answer_set,int num){//第10题函数
int count[4]={0,0,0,0};
int indexNum;
int temp,i,j;
for (indexNum=0;indexNum<10;indexNum++){
if (answer_set[num].index[indexNum]=='a')
count[0]=count[0]+1;
else if(answer_set[num].index[indexNum]=='b')
count[1]=count[1]+1;
else if(answer_set[num].index[indexNum]=='c')
count[2]=count[2]+1;
else if(answer_set[num].index[indexNum]=='d')
count[3]=count[3]+1;
}
for(i=0;i<3;i++){
for(j=0;j<3-i;j++)
if(count[j]>count[j+1]){
temp=count[j];
count[j]=count[j+1];
count[j+1]=temp;
}
}
return (count[3]-count[0]);
}
BOOL question9(struct answer* answer_set,int num){//第十题的命题判断函数
if(num>=1048576||num<0){
printf("答案编号输入错误\n");
return 0;
} else if (answer_set[num].index[9]<97||answer_set[num].index[9]>100){
printf("答案选项输入错误\n");
return 0;
}//输入检查
if(answer_set[num].index[9]=='a'){//答案为a时
if(max_Minus_min(answer_set,num)==3) return 1;
else return 0;
}
if(answer_set[num].index[9]=='b'){//答案为b时
if(max_Minus_min(answer_set,num)==2) return 1;
else return 0;
}
if(answer_set[num].index[9]=='c'){//答案为c时
if(max_Minus_min(answer_set,num)==4) return 1;
else return 0;
}
if(answer_set[num].index[9]=='d'){//答案为d时
if(max_Minus_min(answer_set,num)==1) return 1;
else return 0;
}
}
int p=0;
void push(int *array,int num){
if (p<10){
array[p]=num;
p++;
}
else
printf("正确答案数量超过10个\n");
}
int main(){
struct answer *answer_set= (struct answer*)malloc(1048576*sizeof(struct answer)); //声明答案数组,为1048576个组员(所有可能的答案)申请空间
init_answer_set(answer_set,0,1048575,0);
int RightAnswers[10];
int num;
int i;
int bl[10]={0};
void printf_bl(int num){
int i;
printf("第%d个答案的bl值是\n",num);
for (i=0;i<10;i++){
printf("%d\t",bl[i]);
}
printf("\n");
}
for(num=0;num<1048576;num++){
if(question0(answer_set,num)==0) continue;
else if(question1(answer_set,num)==0) continue;
else if(question2(answer_set,num)==0) continue;
else if(question3(answer_set,num)==0) continue;
else if(question4(answer_set,num)==0) continue;
else if(question5(answer_set,num)==0) continue;
else if(question6(answer_set,num)==0) continue;
else if(question7(answer_set,num)==0) continue;
else if(question8(answer_set,num)==0) continue;
else if(question9(answer_set,num)==0) continue;
else{
push(RightAnswers,num);
printf("找到一个正确答案,编号是%d\n",num);
// getchar();
}
}
for(i=0;i<p;i++){
printf_answer(answer_set,RightAnswers[i]);
}
}
最后运行,花费0.09秒得出答案:BCACACDABA。