该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

//修正了一下

#include

#include

#include

#include

#include

#include

using namespace std;unordered_map&, char) >>

is_right = {

{ 1,[](vector& vec,char c)->bool {return true;} },

{ 2,[](vector& vec,char c)->bool {

char answers[5] = "CDAB";

return vec[5]== answers[c - 'A'];

} },

{ 3,[](vector& vec,char c)->bool{

char answers[5] = "3624";

int count = 0;

for (int i = 0;i != 4;i++)

{

if (vec[answers[c - 'A']-'0'] == vec[answers[i]-'0'] )

count++;

}

return count==1?true:false;

} },

{ 4,[](vector& vec,char c)->bool {

char answers[9] = "1527196:";//此处冒号指10

return vec[answers[(c - 'A') * 2] - '0'] == vec[answers[(c - 'A') * 2 + 1] - '0'];

} },

{ 5,[](vector& vec,char c) ->bool{

char answers[5] = "8497";

return c == vec[answers[c-'A'] - '0'];

} },

{ 6,[](vector& vec,char c)->bool {

char answers[9] = "24163:59";

return vec[8] == vec[answers[(c - 'A') * 2] - '0'] && vec[8] == vec[answers[(c - 'A') * 2 + 1] - '0'];

} },

{ 7,[](vector& vec,char c)->bool {

char answers[5] = "CBAD";

int count[4] = { 0 };

for (int i = 1;i != 11;i++) {

count[vec[i] - 'A']++;

}

int minnum = 10;

for (auto an : count) {

if(an < minnum)

minnum = an;

}

return minnum == count[answers[c - 'A'] - 'A'];

} },

{ 8,[](vector& vec,char c) ->bool{

char answers[5] = "752:";

return abs(vec[answers[c - 'A'] - '0'] - vec[1]) > 1 ? true : false;

} },

{ 9,[](vector& vec,char c)->bool {

char answers[5] = "6:29";

if (vec[1] == vec[6]) {

return vec[answers[c - 'A'] - '0'] != vec[5];

}

else {

return vec[answers[c - 'A'] - '0'] == vec[5];

}

} },

{ 10,[](vector& vec,char c)->bool {

char answers[5] = "3241";

int count[4] = { 0 };

for (int i = 1;i != 11;i++) {

count[vec[i] - 'A']++;

}

std::sort(begin(count), end(count));

return count[3] - count[0] == (int)(answers[c - 'A'] - '0');

} },

};

bool next(vector &vec) {

int i = 1;

++vec[i];

while ( vec[i] > 'D') {

vec[i] = 'A';

++i;

if (i > 10) return false;

++vec[i];

}

return true;

}int main() {

//0号空着

vector vec(11, 'A'); do{

bool flag = true;

for (int i = 1;i != 11;i++)

if (!is_right[i](vec, vec[i])) {

flag = false;

break;

}

if (flag) {

for (int i = 1;i != 11;i++)

cout << vec[i] << ' ';

cout << endl;

}

} while (next(vec)); getchar();

return 0;}