Add problem 3184: Count Pairs That Form a Complete Day I

Author: EFanZh

src/lib.rs

@@ -2124,6 +2124,7 @@ pub mod problem_3174_clear_digits;
 pub mod problem_3175_find_the_first_player_to_win_k_games_in_a_row;
 pub mod problem_3178_find_the_child_who_has_the_ball_after_k_seconds;
 pub mod problem_3179_find_the_n_th_value_after_k_seconds;
+pub mod problem_3184_count_pairs_that_form_a_complete_day_i;
 pub mod problem_3350_adjacent_increasing_subarrays_detection_ii;
 
 #[cfg(test)]

src/problem_3184_count_pairs_that_form_a_complete_day_i/mod.rs

@@ -0,0 +1,18 @@
+pub mod modular_arithmetic;
+
+pub trait Solution {
+    fn count_complete_day_pairs(hours: Vec<i32>) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [(&[12, 12, 30, 24, 24] as &[_], 2), (&[72, 48, 24, 3], 3)];
+
+        for (hours, expected) in test_cases {
+            assert_eq!(S::count_complete_day_pairs(hours.to_vec()), expected);
+        }
+    }
+}

src/problem_3184_count_pairs_that_form_a_complete_day_i/modular_arithmetic.rs

@@ -0,0 +1,35 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn count_complete_day_pairs(hours: Vec<i32>) -> i32 {
+        let mut counts = [0; 24];
+        let mut result = 0;
+
+        for hour in hours {
+            let hour = (hour.cast_unsigned() % 24) as usize;
+
+            result += counts[if hour == 0 { 0 } else { 24 - hour }];
+            counts[hour] += 1;
+        }
+
+        result
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn count_complete_day_pairs(hours: Vec<i32>) -> i32 {
+        Self::count_complete_day_pairs(hours)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}