寒假训练数论A

题目
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.
题目大意
求一个最小的数是n的倍数,且末尾有k个零。
解题思路
这个最小的数为n与10^k的最小公倍数。
代码

#include <cstdio>
#include <iostream> 
using namespace std;
long long gcd(long long a,long long b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}
int main()
{
	long long n,k,s=1;
	cin>>n>>k;
	while (k--) s=s*10;
	cout<<n*s/gcd(n,s)<<endl;
	  
}