Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions:2133 | Accepted: 1105 |
Description
As stated earlier, each S-tree represents a Boolean function f. If you have an S-tree 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.

On the picture, two S-trees 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)
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 S-tree and some VVAs and computes f(x1,x2,...,xn) as described above.
Input
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 new-line character. The characters are given in the order in which they appear in the S-tree, the first character corresponds to the leftmost terminal node of the S-tree, 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 new-line character. Regardless of the variable ordering of the S-tree, 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
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
S-Tree #1:
0011
S-Tree #2:
0011
Source
代码:
#include <iostream> #include <string> #include <cmath> using namespace std; string str[10]; int a[1000]; int b[10]; int num; int main() { int n; int m; int id = 1; while (cin>>n) { if (n == 0) { break; } else { for (int i = 0; i < n; i++) { cin >> str[i]; } getchar(); string ch; getline(cin, ch); num = pow(2.0, n); for (int i = 0; i < num; i++) { a[i] = ch[i]-48; } cin >> m; getchar(); char result[10]; for (int i = 0; i < m; i++) { int k = 0; string ch1; getline(cin, ch1); for (int j = 0; j < n; j++) { b[j] =ch1[j]-48; k += b[j] * pow(2.0, n - 1 - j); } result[i] = ch[k]; } cout<<"S-Tree #"<<id++<<":"<<endl; for (int i = 0; i < m; i++) { cout << result[i]; if (i == m - 1) { cout << endl; } } cout << endl; } } return 0; }