Skip to content

Kevin's Home

HDU 4952 Number Transformation

数论, 暴力1 min read

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 612    Accepted Submission(s): 310

Problem Description

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.

Sample Input

Sample Output


2014 Multi-University Training Contest 8


hujie   |   We have carefully selected several similar problems for you:  4955 4954 4953 4951 4950