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

建议使用的浏览器：

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

4722：Good Numbers

题目描述
If we sum up every digit of a number and the result can be exactly divided by 10, we say this number is a good number.
You are required to count the number of good numbers in the range from A to B, inclusive.
输入解释
The first line has a number T (T <= 10000) , indicating the number of test cases.
Each test case comes with a single line with two numbers A and B (0 <= A <= B <= 1018).
输出解释
For test case X, output "Case #X: " first, then output the number of good numbers in a single line.
输入样例 
2
1 10
1 20
输出样例 
Case #1: 0
Case #2: 1
提示
The answer maybe very large, we recommend you to use long long instead of int.
来自杭电HDUOJ的附加信息
Recommend zhuyuanchen520
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 2013 ACM/ICPC Asia Regional Online —— Warmup2
源链接： HDU-4722
最后修改于 2020-10-25T23:16:12+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)