Question 1498: Search for expressions

/* Question 1498: directly search for expressions for complexity 3 ^ 14 Power */# include <stdio. h> int n; int op [20]; bool judge () {int ans; if (op [1] = 0) ans = 0; else ans = 1; int I = 1; int temp; while (I <n) {if (op [I] = 0) {temp = I; while (I <n & op [I] = 0) {I ++; if (I> = 10) temp = temp * 100 + I; elsetemp = temp * 10 + I;} ans + = temp;} else if (op [I] = 1) {temp = ++ I; while (I <n & op [I] = 0) {I ++; if (I> = 10) temp = temp * 100 + I; elsetemp = temp * 10 + I;} ans + = temp;} else {temp = ++ I; while (I <n & op [I] = 0) {I ++; if ( I >= 10) temp = temp * 100 + I; elsetemp = temp * 10 + I;} ans-= temp ;}} if (ans = 0) return 1; return 0;} void prit () {for (int I = 1; I <n; I ++) {if (op [I] = 0) printf ("% d", I); else if (op [I] = 1) printf ("% d +", I); elseprintf ("% d -", i);} printf ("% d \ n", n);} void dfs (int x) {if (x = n) {if (judge ()) prit (); return;} op [x] = 0; dfs (x + 1); op [x] = 1; dfs (x + 1 ); op [x] = 2; dfs (x + 1);} int main () {// printf ("% d \ n ",'', '+', '-'); while (scanf ("% d", & n )! = EOF) {dfs (1);} return 0 ;}