2014ACM真题.docVIP

The 7th ACM-ICPC Liaoning Province CPC Online Contest Problem A: Guess Time Limit:?1 Sec??Memory Limit:?32 MBSubmit:?176??Solved:?148[Submit][Status][Web Board] Description In the television program Shopping Street of CCTV-2, two people, A and B are guessing the price of a given item. You are asked to decide whose price is closer to the real price.? Input There are multiple test cases. The first line of input is an integer T (T = 20) indicating the number of test cases. Each case contains three integers in one line: P, PA, PB (0 = PA, PB, P = 100, | PA – P | != | PB – P |), indicating the real price, the price A guesses and the price B guesses. Output For each case, output A or B according to whose price is closer to the real price. Sample Input 4 10 8 7 20 20 19 100 9 50 50 39 60 Sample Output A A B B HINT Problem B: Repeat Number Time Limit:?1 Sec??Memory Limit:?32 MBSubmit:?408??Solved:?42[Submit][Status][Web Board] Description Definition: a+b = c, if all the digits of c are same ( c is more than ten)，then we call a and b are Repeat Number. My question is How many Repeat Numbers in [x,y]. Input There are several test cases. Each test cases contains two integers x, y(1=x=y=1,000,000) described above. Proceed to the end of file. Output For each test output the number of couple of Repeat Number in one line. Sample Input 1 10 10 12 Sample Output 5 2 HINT If a equals b, we can call a, b are Repeat Numbers too, and a is the Repeat Numbers for itself.?? Problem C: Base64 Coding Time Limit:?1 Sec??Memory Limit:?32 MBSubmit:?3??Solved:?1[Submit][Status][Web Board] Description ??? Base64 is an encoding algorithm. It works by turning characters whose ASCII code is between 0x00 and 0xff into strings of only lower case letters, upper case letters and digits, thus avoiding the encoding ambiguous problem.?Lets take a look at a simple example.??Before transformation:10111010After transformation:0001101100110110??Their v