S-Trees 

A Strange Tree (S-tree) over the variable set  is a binary tree representing a Boolean function . Each path of the S-tree begins at the root node and consists of n+1 nodes. Each of the S-tree'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 non-terminal nodes. All non-terminal nodes have two children: the right child and the left child. Each non-terminal node is marked with some variablexi from the variable set Xn. All non-terminal nodes with the same depth are marked with the same variable, and non-terminal 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  is called the variable ordering. The nodes having depth nare 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 S-tree.
As stated earlier, each S-tree represents a Boolean function f. If you have an S-tree and values for the variables , then it is quite simple to find out what  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: S-trees for the function 
On the picture, two S-trees representing the same Boolean function, , 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 , are given as a Variable Values Assignment (VVA) 
with 
. For instance, ( 
x
일
 = 1, 
x
이
 = 1 
x
삼
 = 0) would be a valid VVA for 
n
 = 3, resulting for the sample function above in the value 
. 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  as described above.
Input 
The input file contains the description of several S-trees with associated VVAs which you have to process. Each description begins with a line containing a single integer 
n
, 
, the depth of the S-tree. This is followed by a line describing the variable ordering of the S-tree. The format of that line is  x
i
일
  x
i
이
... x
i
n
. (There will be exactly 
n
 different space-separated strings). So, for 
n
 = 3 and the variable ordering
x
삼
, 
x
일
, 
x
이
, 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 2ncharacters (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 
For each S-tree, output the line `` S-Tree #
j :
", where 
j
 is the number of the S-tree. Then print a line that contains the value of 
 for each of the given 
m
 VVAs, where 
f
 is the function defined by the S-tree.
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

구토를 참지 못하다.UVa의 제목은 이해하기 어렵고 자신의 영어 수준도 부족하다.그래서 사실 이 문제는 문제의 뜻을 이해하기만 하면 매우 간단하다.
완전히 두 갈래 나무가 있는데, 각 층 위의 결점 값이 같다.그리고 마지막 잎의 값을 알려주세요. (왼쪽에서 오른쪽으로 순서대로 배열하세요)
그런 다음 루트 노드에서 시작하여 0이면 왼쪽 트리, 1이면 오른쪽 트리로 이동합니다.마지막에 잎이 얼마나 됐냐고 물어보세요.
다음은 몇 개의 데이터가 있는데, 각 그룹은 두 갈래 나무의 각 층의 값을 알려준다.
사실 나무를 세울 필요가 없다. 두 갈래 나무의 특성에 따라 결점은 k이고 왼쪽 나무는 2*k-1이며 오른쪽 나무는 2*k이다.그래서 바로 답을 얻을 수 있다.

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
int main ()
{
    int n,i,j,t=1;
    char str[1000];
    while(cin>>n)
    {
        int a[1000]={0};
        if (n==0) break;
        getchar();
        gets(str);
        gets(str);
        printf("S-Tree #%d:
",t++);
        int m,k=1,p=0;
        char num[1000];
        cin>>m;
        getchar();
        char fi[1000];
        while(m--)
        {
            k=1;
            gets(num);
            int len=strlen(num);
            for (i=0; i<len; i++)
                if (num[i]=='0')
                    k=2*k-1;
                else
                    k=2*k;
            fi[p++]=str[k-1];
        }
        fi[p]='\0';
        cout<<fi<<endl;
        cout<<endl;
    }
    return 0;
}