回溯法（1）

/* A B C D E D F G + D F G ————— X Y Z D E */ /* E = (E + G + G) % 10; D = ((D + F + F) + (E + G + G) / 10) % 10; Z = ((C + D + D) + ((D + F + F) + (E + G + G) / 10) / 10) % 10; Y = (B + ((C + D + D) + ((D + F + F) + (E + G + G) / 10) / 10 ) / 10) %10; X = (A + (B + ((C + D + D) + ((D + F + F) + (E + G + G) / 10) / 10 ) / 10 ) / 10) %10; */ /* Test 1(Level 2): E G Test 2(Level 4): F D Test 3(Level 6): C Z Test 4(Level 8): B Y Test 5(Level 10): A X */ //#include "header.h" #include <iostream> #include <deque> #define V(a) current[a] #define S(i, j) (source[i])[j] #if 0 #define OUT cout << current.size() << endl; #else if 1 #define OUT ; #endif using namespace std; static const int E(0), G(1), F(2), D(3), C(4), Z(5), B(6), Y(7), A(8), X(9); static deque<int> current; // 输出堆栈 static bool check() { int i = 0, j = 0; int level = current.size(); // 是否有相等元素 for(i = 0; i < level; i++) { for(j = i + 1; j < level; j++) { if(V(i) == V(j)) return false; } } // 规则检查 switch(level) { case 2: return V(E) == (V(E) + V(G) + V(G)) % 10; case 4: return V(D) == ((V(D) + V(F) + V(F)) + (V(E) + V(G) + V(G)) / 10) % 10; case 6: return V(Z) == ((V(C) + V(D) + V(D)) + ((V(D) + V(F) + V(F)) + (V(E) + V(G) + V(G)) / 10) / 10) % 10; case 8: return V(Y) == (V(B) + ((V(C) + V(D) + V(D)) + ((V(D) + V(F) + V(F)) + (V(E) + V(G) + V(G)) / 10) / 10 ) / 10) %10; case 10: return V(X) == (V(A) + (V(B) + ((V(C) + V(D) + V(D)) + ((V(D) + V(F) + V(F)) + (V(E) + V(G) + V(G)) / 10) / 10 ) / 10 ) / 10) %10; default: return true; } } void question_1() { int i(0), j(0); int e(0), g(0), f(0), d(0), c(0), z(0), b(0), y(0), a(0), x(0); deque<int> source[10]; current.clear(); for(i = 0; i < 10; i++) { for(j = 0; j < 10; j++) { source[i].push_back(j); } } while(e < 10) { current.push_back(S(E, e++)); if(!check()) { current.pop_back(); continue; } OUT; g = 0; while(g < 10) { current.push_back(S(G, g++)); if(!check()) { current.pop_back(); continue; } OUT; f = 0; while(f < 10) { current.push_back(S(F, f++)); if(!check()) { current.pop_back(); continue; } OUT; d = 0; while(d < 10) { current.push_back(S(D, d++)); if(!check()) { current.pop_back(); continue; } OUT; c = 0; while(c < 10) { current.push_back(S(C, c++)); if(!check()) { current.pop_back(); continue; } OUT; z = 0; while(z < 10) { current.push_back(S(Z, z++)); if(!check()) { current.pop_back(); continue; } OUT; b = 0; while(b < 10) { current.push_back(S(B, b++)); if(!check()) { current.pop_back(); continue; } OUT; y = 0; while(y < 10) { current.push_back(S(Y, y++)); if(!check()) { current.pop_back(); continue; } OUT; a = 0; while(a < 10) { current.push_back(S(A, a++)); if(!check()) { current.pop_back(); continue; } OUT; x = 0; while(x < 10) { current.push_back(S(X, x++)); if(!check()) { current.pop_back(); continue; } else { // true result cout << "result is:" << endl; cout << V(A) << " " << V(B) << " " << V(C) << " " << V(D) << " " << V(E) << endl; cout << " " << V(D) << " " << V(F) << " " << V(G) << endl; cout << "+ " << V(D) << " " << V(F) << " " << V(G) << endl; cout << "----------" << endl; cout << V(X) << " " << V(Y) << " " << V(Z) << " " << V(D) << " " << V(E) << endl; return; } } current.pop_back(); } current.pop_back(); } current.pop_back(); } current.pop_back(); } current.pop_back(); } current.pop_back(); } current.pop_back(); } current.pop_back(); } current.pop_back(); } cout << "no result" << endl; } void main() { question_1(); }