|
||||||||||
Bi-peak NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1628 Accepted Submission(s): 504 Problem Description A peak number is defined as continuous digits {D0, D1 ¡ Dn-1} (D0 > 0 and n >= 3), which exist Dm (0 < m < n - 1) satisfied Di-1 < Di (0 < i <= m) and Di > Di+1 (m <= i < n - 1). A number is called bi-peak if it is a concatenation of two peak numbers. The score of a number is the sum of all digits. Love8909 is crazy about bi-peak numbers. Please help him to calculate the MAXIMUM score of the Bi-peak Number in the closed interval [A, B]. Input The first line of the input is an integer T (T <= 1000), which stands for the number of test cases you need to solve. Each case consists of two integers ¡°A B¡± (without quotes) (0 <= A <= B < 2^64) in a single line. Output For the kth case, output ¡°Case k: v¡± in a single line where v is the maximum score. If no bi-peak number exists, output 0. Sample Input
Sample Output
Author love8909 Source | ||||||||||
|