4A: k-rounding

题目来源

题目

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.

Input
The only line contains two integers n and k (1 ≤ n ≤ 1e9, 0 ≤ k ≤ 8).

Output
Print the k-rounding of n.

Examples

Input

375 4

Output

30000

Input

10000 1

Output

10000

Input

38101 0

Output

38101

Input

123456789 8

Output

12345678900000000

题意

给定一个n, k
输出一个数， 该数以k个0结尾， 且为n的倍数， 要求该数最小

解法

结尾若为0， 则必定含有2和5这两个因子， 把这两个因子筛掉， 然后补上结尾k个0就可以了

代码

#include <iostream>
#include <cmath>
using namespace std;

int main() {
	long long int n, k;
	cin >> n >> k;
	int num2 = 0;
	int num5 = 0;
	while(n%5==0 && num5<k) {
		n /= 5;
		num5++;
	}
	while(n%2==0 && num2<k) {
		n /= 2;
		num2++;
	}

	for(int i=0; i<k; ++i) n *=10;
	cout << n;

	return 0;
}