Counterfeit Dollar（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH020115）

本文主要是介绍Counterfeit Dollar（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH020115），希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

描述：

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.

样例输入：

ABCD EFGH even

ABCI EFJK up

ABIJ EFGH even

样例输出：

K is the counterfeit coin and it is light.

翻译：

假币

Sally Jones有一沓Voyageur银币，这里面的11枚是真的，1枚是假的虽然它的颜色和大小都和真的银币没有区别。这个假币和其他的银币的重量不同，但是Sally它是比真的银币重还是轻。

令人开心的是，Sally有一个能够借给她一个很精确的称的朋友。这个朋友承诺将会三次称重就找出假币。立刻地，如果Sally称重两枚硬币彼此平衡并且那么Sally就会知道第三枚硬币是假币她就能够基于称是否平衡说出它是轻的还是重的。

通过仔细的选择称重的组合，Sally就能够确保她将会确切地从三次称量中找到假币。

输入：

第一行输入的是一个整数n（n>0）它指定了后面要了解的案例。每个案例由三行输入组成。每个案例，每行输入代表每次的称重。Sally用A--L来表示每个硬币。称重的信息将会被用两个的字符串和up，down，even来给出。最初的字符串将会代表硬币的左边平衡态，第二个字符串将会代表右面的硬币状态（Sally将总是会放置和左边称上同样数目的硬币在右面的称上。）在第三个位置上的单词可以描述出右边的硬币是是上升下降还是平等。

输出：

对于每个案例，输出通过它的字母将会识别出假币并且输出他是轻的还是重的。这个答案将总是唯一被确定的。