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.

Examples

Input
375 4
Output
30000
Input
10000 1
Output
10000
Input
38101 0
Output
38101
Input
123456789 8
Output
12345678900000000

代码实现：

/*
    给出一个k和一个m，找一个最小的数x，且该数满足x%k==0并且末尾的0的数量大于等于m
    只要对k先不停的除5再不停的除2，所得到的结果末尾加上m个0就可以了
    由于数据范围过大所以定义为long long型  
*/
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
    
    long long n,k;
    scanf("%lld %lld",&n,&k);
    int x=0,y=0;
    while(n%5==0&&x<k)	//除以5
    {
        n/=5;
        x++;
    }
    while(n%2==0&&y<k)	//除以2
    {
        n/=2;
        y++;
    }
    for(int i=0;i<k;i++)	//后面加上m个0
    {
        n*=10;
    }
    printf("%lld\n",n);
    return 0;
}

---

原题链接：
http://codeforces.com/problemset/problem/858/A
https://vjudge.net/problem/CodeForces-858A