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

建议使用的浏览器：

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

4952：Number Transformation

题目描述
Teacher Mai has an integer x.

He does the following operations k times. In the i-th operation, x becomes the least integer no less than x, which is the multiple of i.

He wants to know what is the number x now.
输入解释
There are multiple test cases, terminated by a line "0 0".

For each test case, the only one line contains two integers x,k(1<=x<=10^10, 1<=k<=10^10).
输出解释
For each test case, output one line "Case #k: x", where k is the case number counting from 1.
输入样例 
2520 10
2520 20
0 0
输出样例 
Case #1: 2520
Case #2: 2600
来自杭电HDUOJ的附加信息
Author xudyh
Recommend
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 2014 Multi-University Training Contest 8
源链接： HDU-4952
最后修改于 2020-10-25T23:18:22+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/65536K(Java/Others)