HDU-4545魔法串

#include <iostream>
#include <string>

int t,m;
char hash[27];
std::string str1,str2;
char a,b;
int pos1,pos2;
int idx;
int main()
{
	while (std::cin>>t){
		for(int i=0;i!=t;i++){
			std::cin>>str1>>str2;
			std::cin>>m;
			for(int i=0;i!=m;i++){
				std::cin>>a>>b;
				hash[a-'a']=b;
			}

			while (pos1!=str1.size()&&pos2!=str2.size()){
				if(str1[pos1]==str2[pos2]){
					pos1++;
					pos2++;
				}else if(hash[str2[pos2]-'a']==str1[pos1]){
					pos1++;
					pos2++;
				}else{
					pos2++;
				}
			}
			std::cout<<"Case #"<<++idx<<": ";
			if(pos1==str1.size()){
				std::cout<<"happy"<<std::endl;
			}else{
				std::cout<<"unhappy"<<std::endl;
			}

			memset(hash,0,sizeof(hash));
			str1.clear();
			str2.clear();
			pos1=pos2=0;
		}
	}

}