POJ 2491 Scavenger Hunt

//map
#include
#include
#include
#include
#include
using namespace std;
int main()
{
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		int steps;
		cin >> steps;
		mapcc;
		map::iterator it;
		string place1,place2;
		for (int i = 1; i <= steps - 1; i++)
		{
			cin >> place1 >> place2;
			cc[place1] = place2;
		}
		it = cc.begin();
		string a = it->first;
		for (it = cc.begin(); it != cc.end(); it++)
		{
			if (it->second == a)
			{
				a = it->first;
			}
		}
		cout << "Scenario #" << i << ":" << endl;
		cout << a << endl;
		cout << cc[a] << endl;
		string temp = cc[a];
		for (int i = 1; i <= steps; i++)
		{
			for (it = cc.begin(); it != cc.end(); it++)
			{
				if (it->first == temp)
				{
					cout << it->second << endl;
					temp = cc[it->first];
					break;
				}
			}
		}	
		cout << endl;
	}
	return 0;
}

 

你可能感兴趣的:(小学期练习——map)