UVa 712 S-Trees S树

一开始脑子比较乱，写了一堆代码都不对，直接删了重来

思路：字符串保存叶子，用映射代表各个节点，用整形n来保存当前节点位置，最后输出

代码：

<span style="font-size:14px;">#include<iostream>
#include<cstdio>
#include<cstring>
#include<map> 
using namespace std;
int deep;
string leaves,order;
map<int,int> m; 
char solve(const string& c)
{
	int n  = 1;
	for (int i = 1;i<=deep;i++)
	if(c[m[i]]=='0') n=2*n; else n = 2*n+1;
	return leaves[n-(1<<deep)];
}
int main()
{
	freopen("std.in","r",stdin);
	freopen("std.out","w",stdout);
	int kase = 0;
	while(cin>>deep&&deep>0)
	{
		string s;
		cout << "S-Tree #" << ++kase << ":\n";
	    for(int i = 1;i<=deep;i++)
	    {
    		cin>>s;
    		m[i] = s[1] - '1';
    	}
    	int n;
    	cin>>leaves>>n;
    	while(n--)
    	{
	    	cin>>order;
    	    cout<<solve(order);
	    }
	    cout<<endl<<endl;
	}
	return 0;
}
</span>