UVA 712 S-Trees

二叉树？ 怒水~~

注意一下查询与x值的对应关系就好~

 #include <iostream>
 #include <cstring>
 #include <cstdio>
 using namespace std;

 int main (){
     char s[];
     int a[],b[];
     int n;
     int m;
     int kase=;
     while (~scanf ("%d",&n)&&n){
         char c[];
         for (int i=;i<n;i++){
             scanf ("%s",c);
             a[i]=c[]-'';//cout<<a[i]<<"eee";
         }
         scanf ("%s",s);
         scanf ("%d",&m);
         printf ("S-Tree #%d:\n",++kase);
         for (int i=;i<m;i++){
             scanf ("%s",c);
             int temp=;
             for (int j=;j<n;j++){
                 b[j]=c[a[j]-]-'';
                 temp=temp*+b[j];
             }
             printf ("%c",s[temp]);//cout<<temp<<"er"<<endl;
         }
         printf ("\n\n");
     }
     return ;
 }