题目描述:
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.
大意:
对于给定的正整数,n表示其k舍入为最小正整数x,使得x以k个或更多个零结尾,以10为基数,可被n整除。
例如,375的四舍五入为375·80 = 30000是最小整数,使得它以4个或更多个零结尾,并且可以被375整除。
编写一个程序,执行n的k舍入。
输入格式:
The only line contains two integers n and k (1 ≤ n ≤ 109,0 ≤ k ≤ 8).
唯一一行包含两个整数n和k(1 ≤ n ≤ 109, 0 ≤ k ≤ 8).
输出格式:
Print the k-rounding of n.
打印n的k舍入。
输入输出样例
Sample 1
Input
375 4
Output
30000
Sample 2
Input
10000 1
Output
10000
Sample 3
Input
38101 0
Output
38101
Sample 4
Input
123456789 8
Output
12345678900000000
思路:
最差的情况是要在a后面加b个0,然后根据a对此进行化简,具体的化简方式是求出a和pow(10,b)的最小公倍数,注意到a,b的范围,可知道数据最大为1*10^17,需要用long long.
代码:
#include<bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b)
{
return b == 0 ? a : gcd(b, a%b);
}
int main(){
long long a;
int b;
cin>>a>>b;
long long z=pow(10,b);
cout<<a/gcd(a,z)*z;
return 0;
}