k-rounding 数论

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.

题意：找到一个最小数满足末尾有至少k个0和并且还是n的倍数。

很显然，最小的情况是n，最大的情况就是npow(10,k)。
我们让 k = pow(10,k);
那么所有可能的情况就是 ans = n(k的因子)。
因此把k的因子从小到大遍历一遍就可以了。

#include <iostream>
#include <cmath>
using namespace std;
int main(){
    long long k,n;    cin>>n>>k;
    k=(long long)pow(10,k);
    for(long long i=1;i<=k;i++){
        if(k%i==0&&i*n%k==0)  { cout<<i*n<<endl;  break;}
    }
    return 0;
}