Pro.ID21402 TitleBean Counting Title链接http://10.20.2.8/oj/exercise/problem?problem_id=21402 AC1 Submit4 Ratio25.00% 时间&空间限制描述The CSC has decided to hold a contest to guess the number of beans in a given jar. To make it a wee bit more interesting, they decided to have the contestants guess the number of a particular kind of bean, the jar having many types of beans in it. Each participant would par $2.00 per guess. If the guess is one off (either one greater or less) than the actual count, they get a single share of the total pot. If the guess is right on, they get two shares of the total pot. Your task is to tally these guesses and print out how much each person wins. 输入The first line will contain hundreds of letters, from a - z, each representing one bean of that type of bean. There will only be 26 different types of beans. Each of the n following line will be the guess from a contestant. A contestant can guess as many times as they like. The line will begin with a single letter, in the range A - Z, leaving only 26 possible contests. The first letter will be followed by a single space, and then up to five pairs of letter/number combinations, the letter representing the type of bean for this guess, and the number the number of that bean the contestant expects to find. The letter and the value of a guess will be separated by a ':' and each guess on lines with more than one guess will be separated by a ','. Tallying: The amount a contestant will receive is based on shares of a pot. The pot will consist of the total of all the guesses, at $2.00 per guess. The fraction each person gets will be based on: TotNum: total number of guesses by all contestants. TotShares: total number of shares from all contestants. OffOne: number of off-by-one guesses by that contestant. RightOn: number of right-on guesses by that contestant. ((TotNum * $2.00) / TotShares) * (OffOne + (RightOn * 2)) 输出Description The CSC has decided to hold a contest to guess the number of beans in a given jar. To make it a wee bit more interesting, they decided to have the contestants guess the number of a particular kind of bean, the jar having many types of beans in it. Each participant would par $2.00 per guess. If the guess is one off (either one greater or less) than the actual count, they get a single share of the total pot. If the guess is right on, they get two shares of the total pot. Your task is to tally these guesses and print out how much each person wins. Input The first line will contain hundreds of letters, from a - z, each representing one bean of that type of bean. There will only be 26 different types of beans. Each of the n following line will be the guess from a contestant. A contestant can guess as many times as they like. The line will begin with a single letter, in the range A - Z, leaving only 26 possible contests. The first letter will be followed by a single space, and then up to five pairs of letter/number combinations, the letter representing the type of bean for this guess, and the number the number of that bean the contestant expects to find. The letter and the value of a guess will be separated by a ':' and each guess on lines with more than one guess will be separated by a ','. Tallying: The amount a contestant will receive is based on shares of a pot. The pot will consist of the total of all the guesses, at $2.00 per guess. The fraction each person gets will be based on: TotNum: total number of guesses by all contestants. TotShares: total number of shares from all contestants. OffOne: number of off-by-one guesses by that contestant. RightOn: number of right-on guesses by that contestant. ((TotNum * $2.00) / TotShares) * (OffOne + (RightOn * 2)) Output Print out all the winners, in alphabetical order, and their winnings, separated by a single space. Each winner should be on a line by itself. Sample Input aadddddddddddddddddddddddffffffffffffffffwwwwwwwwwwwwccccalalala Sample Output A 3.20 Source 样例输入aadddddddddddddddddddddddffffffffffffffffwwwwwwwwwwwwccccalalala 样例输出A 3.20 作者 |
|Archiver|手机版|小黑屋|同和创作矩阵
( 粤ICP备20019636号-1 )
GMT+8, 2025-2-3 00:55 , Processed in 0.017096 second(s), 14 queries .
Powered by Discuz! X3.4 Licensed
© 2001-2017 Comsenz Inc.
