title: Find Value Of Y Mod 2 Raised To Power X
signature: pub fn find_value_of_y_mod_2_raised_to_power_x(y: 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(y: i32, x: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(y, x), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        57, 76, 
        57
      ));
      
      println!("TEST-1...{}", driver(
        80, 46, 
        80
      ));
      
      println!("TEST-2...{}", driver(
        84, 96, 
        84
      ));
      
      println!("TEST-3...{}", driver(
        35, 16, 
        35
      ));
      
      println!("TEST-4...{}", driver(
        3, 84, 
        3
      ));
      
      println!("TEST-5...{}", driver(
        42, 79, 
        42
      ));
      
      println!("TEST-6...{}", driver(
        7, 2, 
        3
      ));
      
      println!("TEST-7...{}", driver(
        99, 83, 
        99
      ));
      
      println!("TEST-8...{}", driver(
        13, 61, 
        13
      ));
      
      println!("TEST-9...{}", driver(
        44, 8, 
        44
      ));
      
  }
source_py: def find_value_of_y_mod_2_raised_to_power_x(y, x):
      return (y % pow(2, x))
source_cpp: long long int find_value_of_y_mod_2_raised_to_power_x(long long int y, long long int x) {
    if ( log2 ( y ) < x ) return y;
    if ( x > 63 ) return y;
    return ( y % ( 1 << x ) );
  }