SLATKISI
Mirko buys a lot of candy in the candy shop. He cannot always pay the exact amount so the shopkeeper and he have an agreement. He tells the shopkeeper the smallest bill he has, and she rounds his amount to the nearest number he can pay. For example, if the smallest bill Mirko has is a hundred bill, and he wants to buy 150 Kunas of candy, the shopkeeper rounds his amount to 200 Kunas. If he wants to buy 149 Kunas of candy, the shopkeeper rounds his amount to 100 Kunas. Lately, Mirko suspects the shopkeeper is trying to cheat him. He asked you to help him. Write a program that will help him.
His mother only gives Mirko 1, 10, 100, 1 000, ... , 1 000 000 000 Kuna bills. He never has bills that are not powers of 10. The bills he does have, he has in large amounts.
] (0 ≤ C ≤ 1 000 000 000), the price of candy Mirko is going to buy. The second line contains an integer, K (0 ≤ K ≤ 9), number of zeros on the smallest bill Mirko has.Input
[c]184 1
Output
180Input
123450995 1Output
123451000Input
182 2Output
200Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.