本文主要是介绍http://noi.openjudge.cn/ch0201/15/，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
描述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.
描述萨利琼斯有一打旅行者银币。然而，只有十一枚硬币是真正的银元；一枚硬币是假的，尽管它的颜色和大小使它与真正的银元无法区分。假币的重量与其他硬币不同，但萨利不知道它比真正的硬币重还是轻。
令人高兴的是，萨莉有一个朋友，他借给她一个非常精确的天平。这位朋友将允许萨利三次称重以找到那枚伪币。例如，如果莎莉称两枚硬币相对，天平平衡，那么她就知道这两枚硬币是真的。如果莎莉称
一个真正的硬币和第三个硬币的天平不平衡，那么莎莉知道第三个硬币是假的，她可以分辨它是轻的还是重的，这取决于它放置的天平分别是上升还是下降。
通过仔细选择她的称量，莎莉能够确保她能找到有三个称量的假币。输入输入的第一行是整数n(n>0)，指定后面的情况数。每个箱子由三条输入线组成，每个称重一条。萨利用字母A-L.称重的信息将由两串字母提供，然后是“向上”、“向下”或“偶数”。第一串字母代表左边的硬币，第二串，右边的硬币。(萨利总是把硬币的数量放在右边的余额上，就像放在左边的余额上一样。)第三个位置上的单词将显示平衡的右侧是上升还是下降，还是保持平衡。对于每一种情况，输出将通过其字母识别假币，并判断它是重的还是轻的。解决方案将永远是独一无二的。
这篇关于http://noi.openjudge.cn/ch0201/15/的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
