当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3565：Bi-peak Number

题目描述
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].
输入解释
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.
输出解释
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.
输入样例 
3
12121 12121
120010 120010
121121 121121
输出样例 
Case 1: 0
Case 2: 0
Case 3: 8
来自杭电HDUOJ的附加信息
Author love8909
Recommend zhouzeyong
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 2010 ACM-ICPC Multi-University Training Contest（13）——Host by UESTC
源链接： HDU-3565
最后修改于 2020-10-25T23:04:48+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/32768K(Java/Others)