Problem:
A Strange Tree (Stree) over the variable set Xn = {x1,x2,...,xn} is a binary tree representing a Boolean function f:{0,1}>{0,1}. Each path of the Stree begins at the root node and consists of n+1 nodes. Each of the Stree's nodes has a depth, which is the amount of nodes between itself and the root (so the root has depth 0). The nodes with depth less than n are called nonterminal nodes. All nonterminal nodes have two children: the right child and the left child. Each nonterminal node is marked with some variable xi from the variable set Xn. All nonterminal nodes with the same depth are marked with the same variable, and nonterminal nodes with different depth are marked with different variables. So, there is a unique variable xi1 corresponding to the root, a unique variable xi2 corresponding to the nodes with depth 1, and so on. The sequence of the variables xi1,xi2,...,xin is called the variable ordering. The nodes having depth n are called terminal nodes. They have no children and are marked with either 0 or 1. Note that the variable ordering and the distribution of 0's and 1's on terminal nodes are sufficient to completely describe an Stree.
As stated earlier, each Stree represents a Boolean function f. If you have an Stree and values for the variables x1,x2,...,xn, then it is quite simple to find out what f(x1,x2,...,xn) is: start with the root. Now repeat the following: if the node you are at is labelled with a variable xi, then depending on whether the value of the variable is 1 or 0, you go its right or left child, respectively. Once you reach a terminal node, its label gives the value of the function.
Figure 1: Strees for the x1 and (x2 or x3) function
On the picture, two Strees representing the same Boolean function,f(x1,x2,x3) = x1 and (x2 or x3), are shown. For the left tree, the variable ordering is x1, x2, x3, and for the right tree it is x3, x1, x2.
The values of the variables x1,x2,...,xn, are given as a Variable Values Assignment (VVA)
(x1 = b1, x2 = b2, ..., xn = bn)
with b1,b2,...,bn in {0,1}. For instance, ( x1 = 1, x2 = 1 x3 = 0) would be a valid VVA for n = 3, resulting for the sample function above in the value f(1,1,0) = 1 and (1 or 0) = 1. The corresponding paths are shown bold in the picture.
Your task is to write a program which takes an Stree and some VVAs and computes f(x1,x2,...,xn) as described above.
Input:
The input contains the description of several Strees with associated VVAs which you have to process. Each description begins with a line containing a single integer n, 1 <= n <= 7, the depth of the Stree. This is followed by a line describing the variable ordering of the Stree. The format of that line is xi1 xi2 ...xin. (There will be exactly n different spaceseparated strings). So, for n = 3 and the variable ordering x3, x1, x2, this line would look as follows:
x3 x1 x2
In the next line the distribution of 0's and 1's over the terminal nodes is given. There will be exactly 2^n characters (each of which can be 0 or 1), followed by the newline character. The characters are given in the order in which they appear in the Stree, the first character corresponds to the leftmost terminal node of the Stree, the last one to its rightmost terminal node.
The next line contains a single integer m, the number of VVAs, followed by m lines describing them. Each of the m lines contains exactly n characters (each of which can be 0 or 1), followed by a newline character. Regardless of the variable ordering of the Stree, the first character always describes the value of x1, the second character describes the value of x2, and so on. So, the line
110
corresponds to the VVA ( x1 = 1, x2 = 1, x3 = 0).
The input is terminated by a test case starting with n = 0. This test case should not be processed.
Output:
For each Stree, output the line ``STree #j:", where j is the number of the Stree. Then print a line that contains the value of f(x1,x2,...,xn) for each of the given m VVAs, where f is the function defined by the Stree.
Output a blank line after each test case.
Sample Input:
3 x1 x2 x3 00000111 4 000 010 111 110 3 x3 x1 x2 00010011 4 000 010 111 110 0
Sample Output:
STree #1: 0011
STree #2: 0011
Solution:
#include<cmath> #include<iostream> #include<string> using namespace std;
// 声明：本代码仅供学习之用，请不要作为个人的成绩提交。 // http://blog.csdn.net/mskia // email: bitrain@hotmail.com
int main(){ int n , m , count = 1; char ch1[ 3 ]; string ch2; int root[ 128 ]; int sequence[ 7 ];
for( ; ; ) { cin >> n; if ( n == 0 ) { break; }
for( int i = 0; i < n; ++i ) { cin >> ch1; sequence[ i ] = ch1[ 1 ]  '1'; } cin >> ch2; int temp = ch2.length( ); for( int i = 0; i < temp; ++i ) { root[ i ] = ch2[ i ]  '0'; } cin >> m;
cout << "STree #" << ++count << ":" << endl;
for( int i = 0; i < m ; ++i ) { cin >> ch2; int pos = 1; for( int j = 0; j < n; ++j ) { if ( ch2[ sequence[ j ] ] == '0' ) { pos *= 2; }else { pos = pos * 2 + 1; } } pos = pow ( 2.0 , n ); cout << root[ pos ]; }
cout << endl << endl; }
return 0; }
