title: Count Pairs Two Sorted Arrays Whose Sum Equal Given Value X
signature: pub fn count_pairs_two_sorted_arrays_whose_sum_equal_given_value_x(arr1: Vec<i32>, arr2: Vec<i32>, m: i32, n: i32, x: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(arr1: Vec<i32>, arr2: Vec<i32>, m: i32, n: i32, x: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(arr1, arr2, m, n, x), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        Vec::from([11, 13, 16, 23, 26, 28, 31, 34, 37, 39, 44, 48, 56, 59, 79, 91, 96, 98]), Vec::from([1, 1, 9, 14, 17, 23, 26, 31, 33, 36, 53, 60, 71, 75, 76, 84, 87, 88]), 9, 15, 11, 
        0
      ));
      
      println!("TEST-1...{}", driver(
        Vec::from([50, 14, -98, 14, 90, 36, 66, 44, 10, -98, -24, -36, -32, -50]), Vec::from([34, -6, -66, 0, -6, 82, 60, -98, -8, 60, -2, 4, 22, 76]), 11, 12, 8, 
        5
      ));
      
      println!("TEST-2...{}", driver(
        Vec::from([0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]), Vec::from([0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]), 14, 9, 12, 
        0
      ));
      
      println!("TEST-3...{}", driver(
        Vec::from([88, 14, 29, 87, 86, 58]), Vec::from([91, 95, 64, 4, 63, 35]), 3, 5, 5, 
        0
      ));
      
      println!("TEST-4...{}", driver(
        Vec::from([-98, -92, -88, -86, -82, -76, -72, -66, -56, -48, -34, -28, -28, -26, -20, -18, -18, -16, -16, -12, -4, 0, 6, 12, 16, 20, 22, 30, 34, 34, 36, 56, 58, 62, 64, 80, 82, 94]), Vec::from([-94, -90, -88, -84, -82, -78, -76, -72, -70, -58, -58, -46, -42, -40, -40, -32, -22, -20, -18, -12, -8, -6, 6, 6, 18, 20, 34, 46, 60, 62, 66, 72, 72, 76, 76, 78, 92, 98]), 34, 32, 23, 
        0
      ));
      
      println!("TEST-5...{}", driver(
        Vec::from([1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0]), Vec::from([1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0]), 39, 26, 34, 
        0
      ));
      
      println!("TEST-6...{}", driver(
        Vec::from([70, 70, 74]), Vec::from([15, 55, 84]), 1, 1, 1, 
        0
      ));
      
      println!("TEST-7...{}", driver(
        Vec::from([-20, -12, -50, 76, 24, 64, -22, -4, -68]), Vec::from([18, 98, -88, 86, 72, -44, 82, 94, 58]), 5, 4, 7, 
        0
      ));
      
      println!("TEST-8...{}", driver(
        Vec::from([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]), Vec::from([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]), 27, 26, 37, 
        0
      ));
      
      println!("TEST-9...{}", driver(
        Vec::from([68, 75, 51, 45, 73, 95, 48, 53, 70, 41, 65, 47, 46, 43, 79, 29, 50]), Vec::from([4, 6, 76, 65, 16, 13, 85, 43, 31, 14, 81, 90, 24, 87, 40, 25, 88]), 10, 10, 9, 
        0
      ));
      
  }
source_py: def count_pairs_two_sorted_arrays_whose_sum_equal_given_value_x(arr1, arr2, m, n, x):
      count = 0
      for i in range(m):
          for j in range(n):
              if ((arr1[i] + arr2[j]) == x):
                  count = (count + 1)
      return count
source_cpp: int count_pairs_two_sorted_arrays_whose_sum_equal_given_value_x(vector<int> arr1, vector<int> arr2, int m, int n, int x) {
    int count = 0;
    for ( int i = 0;
    i < m;
    i ++ ) for ( int j = 0;
    j < n;
    j ++ ) if ( ( arr1 [ i ] + arr2 [ j ] ) == x ) count ++;
    return count;
  }