title: Count Number Ways Tile Floor Size N X M Using 1 X M Size Tiles
signature: pub fn count_number_ways_tile_floor_size_n_x_m_using_1_x_m_size_tiles(n: i32, m: i32) -> i64 {
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: i64, expected: i64)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, m: i32, expected: i64)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n, m), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        93, 54, 
        41
      ));
      
      println!("TEST-1...{}", driver(
        17, 4, 
        131
      ));
      
      println!("TEST-2...{}", driver(
        38, 39, 
        1
      ));
      
      println!("TEST-3...{}", driver(
        33, 64, 
        1
      ));
      
      println!("TEST-4...{}", driver(
        78, 35, 
        90
      ));
      
      println!("TEST-5...{}", driver(
        40, 61, 
        1
      ));
      
      println!("TEST-6...{}", driver(
        95, 6, 
        10665883415
      ));
      
      println!("TEST-7...{}", driver(
        12, 8, 
        6
      ));
      
      println!("TEST-8...{}", driver(
        69, 60, 
        11
      ));
      
      println!("TEST-9...{}", driver(
        78, 21, 
        1578
      ));
      
  }
source_py: def count_number_ways_tile_floor_size_n_x_m_using_1_x_m_size_tiles(n, m):
      count = []
      for i in range((n + 2)):
          count.append(0)
      count[0] = 0
      for i in range(1, (n + 1)):
          if (i > m):
              count[i] = (count[(i - 1)] + count[(i - m)])
          elif (i < m):
              count[i] = 1
          else:
              count[i] = 2
      return count[n]
source_cpp: int count_number_ways_tile_floor_size_n_x_m_using_1_x_m_size_tiles(int n, int m) {
    int count [ n + 1 ];
    count [ 0 ] = 0;
    for ( int i = 1;
    i <= n;
    i ++ ) {
      if ( i > m ) count [ i ] = count [ i - 1 ] + count [ i - m ];
      else if ( i < m ) count [ i ] = 1;
      else count [ i ] = 2;
    }
    return count [ n ];
  }