hdu 4952 Number Transformation--2014 Multi-University Training Contest 8

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4952

Number Transformation

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

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.

 

Input

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).

 

Output

For each test case, output one line "Case #k: x", where k is the case number counting from 1.

 

Sample Input

  
  

   
   2520 10
2520 20
0 0
  
  

 

Sample Output

  
  

   
   Case #1: 2520
Case #2: 2600
  
  

 

Source

2014 Multi-University Training Contest 8

 

Recommend

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

 

Statistic |  Submit |  Discuss |  Note

(i+1)*_x>=i*x   可得 _x>=x-x/(i+1).即 _x=x-[x/(i+1)],所以当x<i+1时，_x值的值就不会发生变化了。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<bitset>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<cstdlib>
using namespace std;
#define CLR(A) memset(A,0,sizeof(A))
typedef long long ll;
int main(){
    ll n,k;
    int ncase=0;
    while(cin>>n>>k&&(n+k)){
         ll tmp=n;
         for(ll i=2;i<=k;i++){
            tmp=tmp-tmp/i;
            if(tmp<i) break;
         }
         printf("Case #%d: %I64d\n",++ncase,tmp*k);
    }
    return 0;
}