源于《三個變態(tài)的循環(huán)》第三題
原文鏈接http://www.cn-java.com/www1/bbs/viewthread.php?tid=93104&extra=page=1
用程序求解:
請回答下面10個問題:
1粪小、第一個答案是b的問題是哪一個庐冯?;
(a)2嗽上;(b) 3;(c)4臭胜;(d)5;(e)6
2、唯一的連續(xù)兩個具有相同答案的問題是:
(a)2郎嫁,3捡硅;(b)3哮内,4;(c)4壮韭,5北发;(d)5,6泰涂;(e)6鲫竞,7;
3逼蒙、本問題答案和哪一個問題的答案相同从绘?
(a)1;(b)2是牢;(c)4僵井;(d)7;(e)6
4驳棱、答案是a的問題的個數(shù)是:
(a)0批什;(b)1;(c)2社搅;(d)3驻债;(e)4
5乳规、本問題答案和哪一個問題的答案相同?
(a)10合呐;(b)9暮的;(c)8;(d)7淌实;(e)6
6冻辩、答案是a的問題的個數(shù)和答案是什么的問題的個數(shù)相同?
(a)b拆祈;(b)c恨闪;(c)d;(d)e放坏;(e)以上都不是
7咙咽、按照字母順序,本問題的答案和下一個問題的答案相差幾個字母轻姿?
(a)4犁珠;(b)3;(c)2互亮;(d)1犁享;(e)0 (注:a和b相差一個字母)
8、答案是元音字母的問題的個數(shù)是:
(a)2豹休;(b)3炊昆;(c)4;(d)5威根;(e)6 (注:a和e是元音字母)
9凤巨、答案是輔音字母的問題的個數(shù)是:
(a)一個質(zhì)數(shù);(b)一個階乘數(shù)洛搀;(c)一個平方數(shù)敢茁;(d)一個立方數(shù),(e)5的倍數(shù)
10留美、本問題的答案是:
(a)a彰檬;(b)b;(c)c谎砾;(d)d逢倍;(e)e
非常暈的一個題目。第一個想到的就是枚舉出所有可能的情況然后判斷是否滿足上面10個條件景图,先上代碼较雕。
public class Demo {
public static final char DEFAULT_CHAR = 'a';
public String[][] QA = null;
private char[] answer = null;
public void go() {
init();
answer = new char[10];
for (char i = 'a'; i <= 'e'; i++) {
answer[0] = i;
for (char j = 'a'; j <= 'e'; j++) {
answer[1] = j;
for (char m = 'a'; m <= 'e'; m++) {
answer[2] = m;
for (char n = 'a'; n <= 'e'; n++) {
answer[3] = n;
for (char a = 'a'; a <= 'e'; a++) {
answer[4] = a;
for (char b = 'a'; b <= 'e'; b++) {
answer[5] = b;
for (char c = 'a'; c <= 'e'; c++) {
answer[6] = c;
for (char d = 'a'; d <= 'e'; d++) {
answer[7] = d;
for (char e = 'a'; e <= 'e'; e++) {
answer[8] = e;
for (char f = 'a'; f <= 'e'; f++) {
answer[9] = f;
if (matcher()) System.out.println(answer);
}
}
}
}
}
}
}
}
}
}
}
/**
* 初始化所有問題的答案
*/
private void init() {
QA = new String[10][5];
QA[0] = new String[]{"2", "3", "4", "5", "6"};
QA[1] = new String[]{"2,3", "3,4", "4,5", "5,6", "6,7"};
QA[2] = new String[]{"1", "2", "4", "7", "6"};
QA[3] = new String[]{"0", "1", "2", "3", "4"};
QA[4] = new String[]{"10", "9", "8", "7", "6"};
QA[5] = new String[]{"b", "c", "d", "e", "a"};
QA[6] = new String[]{"4", "3", "2", "1", "0"};
QA[7] = new String[]{"2", "3", "4", "5", "6"};
QA[8] = new String[]{"a", "b", "c", "d", "e"};
QA[9] = new String[]{"a", "b", "c", "d", "e"};
}
private boolean matcher() {
return No1() && No2() && No3() && No4() && No5() && No6() && No7() && No8() && No9();
}
/**
* 1、第一個答案是b的問題是哪一個挚币?
*/
private boolean No1() {
int n = indexOf('b');
return n > -1 && n + 1 == QA[0][getAns(1)].charAt(0) - '0';
}
/**
* 2亮蒋、唯一的連續(xù)兩個具有相同答案的問題是:
*/
private boolean No2() {
int cnt = 0, idx = 0;
while (idx < answer.length - 1) {
if (answer[idx] == answer[++idx]) {
cnt++;
}
}
if (cnt != 1) return false;
String ans = QA[1][getAns(2)];
return answer[ans.charAt(0) - '0' - 1] == answer[ans.charAt(2) - '0' - 1];
}
/**
* 3扣典、本問題答案和哪一個問題的答案相同?
*/
private boolean No3() {
return answer[QA[2][getAns(3)].charAt(0) - '0' - 1] - DEFAULT_CHAR == getAns(3);
}
/**
* 4宛蚓、答案是a的問題的個數(shù)是:
*/
private boolean No4() {
return QA[3][getAns(4)].charAt(0) - '0' - 1 == countChar(DEFAULT_CHAR);
}
/**
* 5激捏、本問題答案和哪一個問題的答案相同设塔?
*/
private boolean No5() {
return answer[QA[4][getAns(5)].charAt(0) - '0' - 1] - DEFAULT_CHAR == getAns(5);
}
/**
* 6凄吏、答案是a的問題的個數(shù)和答案是什么的問題的個數(shù)相同?
*/
private boolean No6() {
return countChar(DEFAULT_CHAR) == countChar(QA[5][getAns(6)].charAt(0));
}
/**
* 7闰蛔、按照字母順序痕钢,本問題的答案和下一個問題的答案相差幾個字母?
*/
private boolean No7() {
return Math.abs(answer[6] - answer[7]) == QA[6][getAns(7)].charAt(0) - '0';
}
/**
* 8序六、答案是元音字母的問題的個數(shù)是:
*/
private boolean No8() {
int c = countChar(DEFAULT_CHAR) + countChar('e');
return QA[7][getAns(8)].charAt(0) - '0' == c;
}
/**
* 9任连、答案是輔音字母的問題的個數(shù)是:
*/
private boolean No9() {
int c = answer.length - countChar(DEFAULT_CHAR) - countChar('e');
boolean v;
switch (getAns(9)) {
case 0:
v = (c == 2 || c == 3 || c == 5 || c == 7);
break;
case 1:
v = (c == 0 || c == 2 || c == 6);
break;
case 2:
v = (c == 1 || c == 4 || c == 9);
break;
case 3:
v = (c == 1 || c == 8);
break;
case 4:
v = (c % 5 == 0);
break;
default:
v = false;
}
return v;
}
/**
* 計算字符串中有多少個指定字符
*/
public int countChar(char c) {
int count = 0;
for (char cc : answer) {
if (cc == c) {
count++;
}
}
return count;
}
/**
* 取得本題答案
*/
public int getAns(int index) {
return answer[index - 1] - DEFAULT_CHAR;
}
public int indexOf(char c) {
for (int i = 0; i < answer.length; i++) {
if (answer[i] == c) {
return i;
}
}
return -1;
}
/**
* 測試代碼
*/
public static void main(String[] args) {
new Demo().go();
}
}
最后得到兩組滿足條件的組合abddaedcbe,cdebeedcbe