title: Compute Modulus Division By A Power Of 2 Number
signature: pub fn compute_modulus_division_by_a_power_of_2_number(n: i32, d: 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(n: i32, d: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n, d), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        54, 59, 
        50
      ));
      
      println!("TEST-1...{}", driver(
        39, 84, 
        3
      ));
      
      println!("TEST-2...{}", driver(
        35, 81, 
        0
      ));
      
      println!("TEST-3...{}", driver(
        9, 60, 
        9
      ));
      
      println!("TEST-4...{}", driver(
        62, 68, 
        2
      ));
      
      println!("TEST-5...{}", driver(
        16, 16, 
        0
      ));
      
      println!("TEST-6...{}", driver(
        93, 96, 
        93
      ));
      
      println!("TEST-7...{}", driver(
        32, 38, 
        32
      ));
      
      println!("TEST-8...{}", driver(
        39, 62, 
        37
      ));
      
      println!("TEST-9...{}", driver(
        63, 16, 
        15
      ));
      
  }
source_py: def compute_modulus_division_by_a_power_of_2_number(n, d):
      return (n & (d - 1))
source_cpp: unsigned int compute_modulus_division_by_a_power_of_2_number(unsigned int n, unsigned int d) {
    return ( n & ( d - 1 ) );
  }