1.16英文翻译(Counterfeit Dollar)

样例：

描述：

Sally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are true silver dollars; one coin is counterfeit even though its color and size make it indistinguishable from the real silver dollars. The counterfeit coin has a different weight from the other coins but Sally does not know if it is heavier or lighter than the real coins.
Happily, Sally has a friend who loans her a very accurate balance scale. The friend will permit Sally three weighings to find the counterfeit coin. For instance, if Sally weighs two coins against each other and the scales balance then she knows these two coins are true. Now if Sally weighs
one of the true coins against a third coin and the scales do not balance then Sally knows the third coin is counterfeit and she can tell whether it is light or heavy depending on whether the balance on which it is placed goes up or down, respectively.
By choosing her weighings carefully, Sally is able to ensure that she will find the counterfeit coin with exactly three weighings.

输入：

The first line of input is an integer n (n > 0) specifying the number of cases to follow. Each case consists of three lines of input, one for each weighing. Sally has identified each of the coins with the letters A--L. Information on a weighing will be given by two strings of letters and then one of the words ``up'', ``down'', or ``even''. The first string of letters will represent the coins on the left balance; the second string, the coins on the right balance. (Sally will always place the same number of coins on the right balance as on the left balance.) The word in the third position will tell whether the right side of the balance goes up, down, or remains even.

输出：

For each case, the output will identify the counterfeit coin by its letter and tell whether it is heavy or light. The solution will always be uniquely determined.

样例输入：

1 
ABCD EFGH even 
ABCI EFJK up 
ABIJ EFGH even 

样例输出：

K is the counterfeit coin and it is light. 

注释：

Source: East Central North America 1998

翻译:

描述：

Sally Jones 拥有一打加拿大银币，然而，仅仅11个硬币是真的银币；一个硬币是假冒的，它的外表跟尺寸无法与真正的银币区分开。这个假冒的硬币拥有跟别的硬币不同的重量。但Sally不能够知道这个假冒的硬币重量是比真的银币重还是轻。

高兴的是，Sally有个朋友loans，她有一个非常精准的平衡天平。loans同意Sally三次去秤重硬币来发现这个假冒的硬币。举个例子，假如Sally 秤重两个硬币，天平平衡，那么这两个硬币是真的银币。现在假如Sally秤重一个真的硬币跟第三个硬币，天平不平衡，那么Sally便知道第三个硬币是假的，她能够通过天平向左倾斜还是向右倾斜来判断这个假硬币相较于真硬币谁轻谁重。

通过细心的选择称量，Sally能够确保三次称量后她能找出那个假的硬币。

输入：

第一行输入一个整数n(n>0)来表示有多少组数据，每组数据有三行输入，Sally为了辨别每个硬币，将硬币分别标为A--L。每行将会输入两个字符串和一个字符串“up”或“down”或“even”。第一个字符串为天平左边放上的硬币标号，第二个字符串为天平右边放上的硬币标号。(Sally总是将相同数量的硬币放入左右天平中)。第三个位置的单词将告诉这个天平的右边是上升了还是下降了还是保持平衡。

输出：

每一行，输出辨别的假冒的硬币的标号和它相较于真正的硬币是重的还是轻的。解总是唯一确定的。

样例输入：
1 
ABCD EFGH even 
ABCI EFJK up 
ABIJ EFGH even 
样例输出：
K is the counterfeit coin and it is light. 

注释：

资料来源：East Central North America 1998