Add problem 2601: Prime Subtraction Operation

Author: EFanZh

src/lib.rs

@@ -1924,6 +1924,7 @@ pub mod problem_2595_number_of_even_and_odd_bits;
 pub mod problem_2596_check_knight_tour_configuration;
 pub mod problem_2598_smallest_missing_non_negative_integer_after_operations;
 pub mod problem_2600_k_items_with_the_maximum_sum;
+pub mod problem_2601_prime_subtraction_operation;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_2601_prime_subtraction_operation/greedy.rs

@@ -0,0 +1,51 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn prime_sub_operation(nums: Vec<i32>) -> bool {
+        const PRIMES: [u16; 168] = [
+            2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103,
+            107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223,
+            227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347,
+            349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463,
+            467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607,
+            613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743,
+            751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883,
+            887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997,
+        ];
+
+        let mut prev = 0;
+
+        nums.iter().all(|&num| {
+            let num = num as u16;
+
+            if num <= prev {
+                return false;
+            }
+
+            let upper_bound = num - prev;
+            let index = PRIMES.partition_point(|&x| x < upper_bound);
+
+            prev = num - PRIMES.get(index.wrapping_sub(1)).copied().unwrap_or(0);
+
+            true
+        })
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn prime_sub_operation(nums: Vec<i32>) -> bool {
+        Self::prime_sub_operation(nums)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_2601_prime_subtraction_operation/mod.rs

@@ -0,0 +1,22 @@
+pub mod greedy;
+
+pub trait Solution {
+    fn prime_sub_operation(nums: Vec<i32>) -> bool;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            (&[4, 9, 6, 10] as &[_], true),
+            (&[6, 8, 11, 12], true),
+            (&[5, 8, 3], false),
+        ];
+
+        for (nums, expected) in test_cases {
+            assert_eq!(S::prime_sub_operation(nums.to_vec()), expected);
+        }
+    }
+}