习题6-2(uva-712)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
int main()
{
	int n, cnt = 0;
	while (cin >> n && n)
	{
		string str, t,ret;
		while (n--) { cin >> str; } 

		cin >> str; cin >> n;

		while (n--)
		{
			cin >> t; 
			unsigned int  index = 1;
			for (int i = 0; i < t.length(); i++)
				if (t[i] == '0') { index = index * 2; } //左走
				else { index = index * 2 + 1; } //右走

			ret.push_back(str[(index) % str.length()]);
		}

		cout << "S-Tree #" << ++cnt << ":" << endl<< ret << endl << endl;;
	}
	return 0;
}