k-rounding//CodeForces - 858A//数论

k-rounding//CodeForces - 858A//数论

---

题目

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
题意
求n的倍数，后面带k个0
链接:https://vjudge.net/contest/351853#problem/A

思路

n后加上k个0然后除以10^k与n的最大公约数

代码

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#define maxn 0x3fffffff

using namespace std;

int main(){
    long long n,k,m=1;
    cin>>n>>k;
    for(int i=0;i<k;i++)
        m*=10;
    cout<<(n*m)/__gcd(n,m)<<endl;
    return 0;
}

注意

来源：CSDN

作者：salty_fishman

链接：https://blog.csdn.net/salty_fishman/article/details/103995937