Add problem 3345: Smallest Divisible Digit Product I

Author: EFanZh

src/lib.rs

@@ -2198,6 +2198,7 @@ pub mod problem_3334_find_the_maximum_factor_score_of_array;
 pub mod problem_3335_total_characters_in_string_after_transformations_i;
 pub mod problem_3337_total_characters_in_string_after_transformations_ii;
 pub mod problem_3340_check_balanced_string;
+pub mod problem_3345_smallest_divisible_digit_product_i;
 pub mod problem_3350_adjacent_increasing_subarrays_detection_ii;
 
 #[cfg(test)]

src/problem_3345_smallest_divisible_digit_product_i/brute_force.rs

@@ -0,0 +1,44 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+use std::num::NonZero;
+
+impl Solution {
+    pub fn smallest_number(n: i32, t: i32) -> i32 {
+        let mut n = n.cast_unsigned();
+        let t = NonZero::new(t.cast_unsigned()).unwrap();
+
+        while {
+            let mut product = 1;
+            let mut x = n;
+
+            while x != 0 {
+                product *= x % 10;
+                x /= 10;
+            }
+
+            product % t != 0
+        } {
+            n += 1;
+        }
+
+        n.cast_signed()
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn smallest_number(n: i32, t: i32) -> i32 {
+        Self::smallest_number(n, t)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3345_smallest_divisible_digit_product_i/mod.rs

@@ -0,0 +1,18 @@
+pub mod brute_force;
+
+pub trait Solution {
+    fn smallest_number(n: i32, t: i32) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [((10, 2), 10), ((15, 3), 16)];
+
+        for ((n, t), expected) in test_cases {
+            assert_eq!(S::smallest_number(n, t), expected);
+        }
+    }
+}