uva608(枚举)

思路：有12个硬币，其中有一个是假的，与真的不同之处是其重量；那么我们就可以枚举假的，然后再枚举假的事比真的重还是轻，然后就根据三个已知情况去判断这个假设是否正确；

/*****************************************
Author      :Crazy_AC(JamesQi)
Time        :2015
File Name   :
*****************************************/
// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
using namespace std;
#define MEM(a,b) memset(a,b,sizeof a)
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> ii;
const int inf = 1 << 30;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
inline int Readint(){
	char c = getchar();
	while(!isdigit(c)) c = getchar();
	int x = 0;
	while(isdigit(c)){
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x;
}
const char res[2][10] = {"heavy","light"};
int t,tmp;
char l[3][105],r[3][105],v[3][105];

bool ok(int tmp,int i,int flag){//0->heavu,1->light;
	int lw=0,rw=0;
	for (int j = 0;j < strlen(l[i]);j++){
		if (tmp & (1 << (l[i][j] - 'A'))) {
			if (flag) lw++;
		}
		else if (!flag) lw++;
	}
	for (int j = 0;j < strlen(r[i]);j++){
		if (tmp & (1 << (r[i][j] - 'A'))){
			if (flag) rw++;
		}
		else if (!flag) rw++;
	}
	if (v[i][0] == 'u'){
		if (lw > rw) return true;
		else return false;
	}
	else if (v[i][0] == 'd'){
		if (lw < rw) return true;
		else return false;
	}
	else {
		if (rw == lw) return true;
		else return false;
	}
}
bool judge(int tmp,int j){
	for (int i = 0;i < 3;i++)
		if (!ok(tmp,i,j)) return false;
	return true;
}
inline void solve(){
	for (int i = 0;i < 12;i++){
		tmp = ((1 << 12) - 1) ^ (1 << i);
		for (int j = 0;j < 2;j++){
			if (judge(tmp,j)) {
				printf("%c is the counterfeit coin and it is %s.\n", 'A' + i, res[j]);
				return ;
			}
		}
	}
}
int main()
{	
	// freopen("in.txt","r",stdin);
	// freopen("out.txt","w",stdout);
	scanf("%d",&t);
	while(t--){
		for (int i = 0;i < 3;i++)
			scanf("%s %s %s",l[i],r[i],v[i]);
		solve();
	}
	return 0;
}