k-rounding

题目描述 给定一个正整数n， 要求求出一个最小的正整数，使得其末尾至少有k个连续的0，并且为n的倍数。 输入格式 只有一行，为n、k两个整数（1<=n<=1e9, 0<=k<=8）。 输出格式 输出所求的最小的满足条件的正整数。 感谢@LPA20020220 提供的翻译

For a given positive integer $ n $ denote its $ k $ -rounding as the minimum positive integer $ x $ , such that $ x $ ends with $ k $ or more zeros in base $ 10 $ and is divisible by $ n $ . For example, $ 4 $ -rounding of $ 375 $ is $ 375·80=30000 $ . $ 30000 $ is the minimum integer such that it ends with $ 4 $ or more zeros and is divisible by $ 375 $ . Write a program that will perform the $ k $ -rounding of $ n $ .

The only line contains two integers $ n $ and $ k $ ( $ 1<=n<=10^{9} $ , $ 0<=k<=8 $ ).

Print the $ k $ -rounding of $ n $ .

375 4

30000

10000 1

10000

38101 0

38101

123456789 8

12345678900000000