ACM第二学期题目报告.docVIP

开放性实验 ACM部分实验报告 目录 1057 Undercut 3 1078 Palindrome Numbers 7 1195 Blowing Fuses 9 1489 2^x mod n = 1 14 1657 Goldbachs Conjecture 20 1755 Clay Bully 23 1813 Bikers Trip Odometer 26 2104 Let the Balloon Rise 29 2105 Number Sequence 32 2208 To and Fro 34 ZOJ Problem Set - 1057 1057 Undercut Time Limit: 1 Second ???? Memory Limit: 32768 KB Undercut is a card game where two players each have five cards numbered one through five. At each round, each player selects a card, then simultaneously reveals it. If the cards are of equal value, there is no score. Otherwise, there are two cases: the two cards are exactly one point apart (this is called an undercut), or the cards are more than one point apart. In the latter case, the person revealing the larger of the cards gets the number of points on the larger card. In the case of an undercut the player with the lower card gets the sum of the two cards. The exception[例外情况] to this is when the cards are 1 and 2, in which case the player with the lower card gets 6 points (instead of only 3 points). After each round, the cards are returned to the hands and they play another round. For example, if there are 5 rounds and player A plays (in this order) 5, 3, 1, 3, 5 and player B plays 3, 3, 3, 3, 4, then the scoring for each round would be: A gets 5 points, no points, B gets 3 points, no points, B gets 9 points. The totals would be A: 5, B: 12. In this problem you will be given card plays for both players and must determine the final scores. Input There will be multiple input instances. Each instance will be one game. The first line of input for a game will be an integer n = 20. (A value of n = 0 terminates input.) The next two lines will each contain n integers between 1 and 5 inclusive indicating the cards played on each of n rounds. The first line are player As card plays and the second line are player Bs card plays. Output Each input instance should generate one line of output of the form: A has a points. B has b po