title: Sequences Given Length Every Element Equal Twice Previous 1
signature: pub fn sequences_given_length_every_element_equal_twice_previous_1(m: i32, n: 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(m: i32, n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(m, n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        10, 4, 
        4
      ));
      
      println!("TEST-1...{}", driver(
        5, 2, 
        6
      ));
      
      println!("TEST-2...{}", driver(
        2, 8, 
        0
      ));
      
      println!("TEST-3...{}", driver(
        83, 7, 
        330
      ));
      
      println!("TEST-4...{}", driver(
        91, 0, 
        0
      ));
      
      println!("TEST-5...{}", driver(
        18, 53, 
        0
      ));
      
      println!("TEST-6...{}", driver(
        83, 41, 
        0
      ));
      
      println!("TEST-7...{}", driver(
        98, 53, 
        0
      ));
      
      println!("TEST-8...{}", driver(
        43, 37, 
        0
      ));
      
      println!("TEST-9...{}", driver(
        31, 20, 
        0
      ));
      
  }
source_py: def sequences_given_length_every_element_equal_twice_previous_1(m, n):
      T = [[0 for i in range((n + 1))] for i in range((m + 1))]
      for i in range((m + 1)):
          for j in range((n + 1)):
              if ((i == 0) or (j == 0)):
                  T[i][j] = 0
              elif (i < j):
                  T[i][j] = 0
              elif (j == 1):
                  T[i][j] = i
              else:
                  T[i][j] = (T[(i - 1)][j] + T[(i // 2)][(j - 1)])
      return T[m][n]
source_cpp: int sequences_given_length_every_element_equal_twice_previous_1(int m, int n) {
    int T [ m + 1 ] [ n + 1 ];
    for ( int i = 0;
    i < m + 1;
    i ++ ) {
      for ( int j = 0;
      j < n + 1;
      j ++ ) {
        if ( i == 0 || j == 0 ) T [ i ] [ j ] = 0;
        else if ( i < j ) T [ i ] [ j ] = 0;
        else if ( j == 1 ) T [ i ] [ j ] = i;
        else T [ i ] [ j ] = T [ i - 1 ] [ j ] + T [ i / 2 ] [ j - 1 ];
      }
    }
    return T [ m ] [ n ];
  }