Add problem 3360: Stone Removal Game

Author: EFanZh

src/lib.rs

@@ -2201,6 +2201,7 @@ pub mod problem_3340_check_balanced_string;
 pub mod problem_3345_smallest_divisible_digit_product_i;
 pub mod problem_3349_adjacent_increasing_subarrays_detection_i;
 pub mod problem_3350_adjacent_increasing_subarrays_detection_ii;
+pub mod problem_3360_stone_removal_game;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_3360_stone_removal_game/brute_force.rs

@@ -0,0 +1,25 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn can_alice_win(n: i32) -> bool {
+        matches! (n, 10..19 | 27..34 | 40..45 | 49..)
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn can_alice_win(n: i32) -> bool {
+        Self::can_alice_win(n)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3360_stone_removal_game/mod.rs

@@ -0,0 +1,16 @@
+pub mod brute_force;
+
+pub trait Solution {
+    fn can_alice_win(n: i32) -> bool;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        for (n, expected) in [(1, false), (12, true)] {
+            assert_eq!(S::can_alice_win(n), expected);
+        }
+    }
+}