给出了整数X和K。任务是找到可被X整除的最小K位数字。
例子:
Input : X = 83, K = 5
Output : 10043
10040 is the smallest 5 digit
number that is multiple of 83.
Input : X = 5, K = 2
Output : 10
一个有效的解决方案是:
Compute MIN : smallest K-digit number (1000...K-times)
If, MIN % X is 0, ans = MIN
else, ans = (MIN + X) - ((MIN + X) % X))
This is because there will be a number in
range [MIN...MIN+X] divisible by X.
// CPP code to find smallest K-digit number
// divisible by X
#include
using namespace std;
// Function to compute the result
int answer(int X, int K)
{
// Computing MIN
int MIN = pow(10, K - 1);
// MIN is the result
if (MIN % X == 0)
return MIN;
// returning ans
return ((MIN + X) - ((MIN + X) % X));
}
// Driver
int main()
{
// Number whose divisible is to be found
int X = 83;
// Max K-digit divisible is to be found
int K = 5;
cout << answer(X, K);
}
输出:
10043
请参阅有关被X整除的最小K位数字的完整文章,以了解更多详细信息!
想要从精选的最佳视频中学习并解决问题,请查看有关从基础到高级C++的C++基础课程以及有关语言和STL的C++ STL课程。要完成从学习语言到DS Algo等的更多准备工作,请参阅“完整面试准备课程” 。