GDUT-寒假专题训练4--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 ≤ 109, 0 ≤ k ≤ 8).

Output

Print the k-rounding of n.

Sample 1

Inputcopy	Outputcopy
375 4	30000

Sample 2

Inputcopy	Outputcopy
10000 1	10000

Sample 3

Inputcopy	Outputcopy
38101 0	38101

Sample 4

Inputcopy	Outputcopy
123456789 8	12345678900000000

题意：这题要找出n的倍数并且最后至少有k个0的数

题解：我们要求出的数是a的倍数并且最后有k个0，要求这个数最小，那么其实就是a与10的k次方的最小公倍数，又因为a*b=gcd(a,b)*lcm(a,b),求出gcd(a,b)即可

代码：

#include <iostream>
#include <string>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <cstdio>

using namespace std;
const int N=1e9+1;
inline int read(){//快读
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
inline gcd(long long a,long long b)//找到大公因子
{
	if (b==0) return a;
	return gcd(b,a%b);
}

int main()
{
	long long a,b,d,f;
	cin >> a >> b;long long c=1;
	for (int i=1;i<=b;i++)
	 c=c*10;//算出10的k次方
	 d=a*c;
	 f=gcd(c,a);
	 cout << d/f;
}