smallest-divisible-digit-product-i

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given two integers <code>n</code> and <code>t</code>. Return the smallest number greater than or equal to <code>n</code> such that the product of its digits is divisible by <code>t</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: n = 10, t = 2

Output: 10

Explanation:

The digit product of 10 is 0, which is divisible by 2, making it the smallest number greater than or equal to 10 that satisfies the condition.
</div>

Example 2:

<div class="example-block">
Input: n = 15, t = 3

Output: 16

Explanation:

The digit product of 16 is 6, which is divisible by 3, making it the smallest number greater than or equal to 15 that satisfies the condition.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 100</code></li>
	<li><code>1 &lt;= t &lt;= 10</code></li>
</ul>

smallestNumber

Smallest Divisible Digit Product I

Smallest Number With Given Digit Product

smallest-number-with-given-digit-product

给定数字乘积的最小数字

Math

Enumeration

给你两个整数&nbsp;<code>n</code> 和&nbsp;<code>t</code>&nbsp;。请你返回大于等于&nbsp;<code>n</code>&nbsp;的&nbsp;最小&nbsp;整数，且该整数的&nbsp;各数位之积&nbsp;能被&nbsp;<code>t</code>&nbsp;整除。

&nbsp;

示例 1：

<div class="example-block">
输入：n = 10, t = 2

输出：10

解释：

10 的数位乘积为 0 ，可以被 2 整除，所以它是大于等于 10 且满足题目要求的最小整数。
</div>

示例 2：

<div class="example-block">
输入：n = 15, t = 3

输出：16

解释：

16 的数位乘积为 6 ，可以被 3 整除，所以它是大于等于 15 且满足题目要求的最小整数。
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= n &lt;= 100</code></li>
	<li><code>1 &lt;= t &lt;= 10</code></li>
</ul>