3345. Smallest Divisible Digit Product I

class Solution {
    public int smallestNumber(int n, int t) {
        while (true) {
            if (digitProduct(n) % t == 0) {
                return n;
            }
            n++;
        }
    }
    
    private int digitProduct(int num) {
        int product = 1;
        while (num > 0) {
            product *= (num % 10);
            num /= 10;
        }
        return product;
    }
}

class Solution:
    def smallestNumber(self, n: int, t: int) -> int:
        while True:
            product = 1
            x = n
            while x > 0:
                product *= x % 10
                x //= 10

            if product % t == 0:
                return n

            n += 1

class Solution {
public:
    int smallestNumber(int n, int t) {
        while (true) {
            if (digitProduct(n) % t == 0) {
                return n;
            }
            n++;
        }
    }

private:
    int digitProduct(int num) {
        int product = 1;
        while (num > 0) {
            product *= (num % 10);
            num /= 10;
        }
        return product;
    }
};

var smallestNumber = function(n, t) {
    while (true) {
        let product = 1;
        let x = n;

        while (x > 0) {
            product *= x % 10;
            x = Math.floor(x / 10);
        }

        if (product % t === 0) {
            return n;
        }

        n++;
    }
};