DCP-217: The Largest Number Back to All Problems

Beginner Beginners Problems > Ad-hoc

---

**Akash** is good at mathematics. One day his father give him a problem. He gives Akash two positive integers **N** and **P**. Akash has to find the ***largest number that can be formed by replacing digits at at most P places in the Number N***. Akash seems that the problem is very tough for him. So he asked you for your help. You will be given two positive integers **N** and **P**. You have to output the largest integer number that can be made by the above procedure. Input: ------ The first line of the input is the number of test cases **T(1 ≤ T ≤ 80)**.<br> Each of the **T** lines contains two integers **N(1 ≤ N ≤ 10^18)** and **P(0 ≤ P ≤ 9)** separated by a single space. Output: ------- For each test case, print a single line **“Case A: X"**(without quotation marks)starting from one in one line. Here **A** is the case number and **X** is the largest number. Sample Input ------------ 2 193 2 70843010538381368 7 Sample Output ------------- Case 1: 999 Case 2: 99999990538381368

---

Problem Setter:

MD. Hasibul Hasan

---

Please login to submit solution to this problem.