title: Count Number Ways Tile Floor Size N X M Using 1 X M Size Tiles
signature: function countNumberWaysTileFloorSizeNXMUsing1XMSizeTiles(n, m) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(n, m, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n, m),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(93, 54, 41);
    console.log(`TEST-0...${result}`);
  
    result = driver(17, 4, 131);
    console.log(`TEST-1...${result}`);
  
    result = driver(38, 39, 1);
    console.log(`TEST-2...${result}`);
  
    result = driver(33, 64, 1);
    console.log(`TEST-3...${result}`);
  
    result = driver(78, 35, 90);
    console.log(`TEST-4...${result}`);
  
    result = driver(40, 61, 1);
    console.log(`TEST-5...${result}`);
  
    result = driver(95, 6, 10665883415);
    console.log(`TEST-6...${result}`);
  
    result = driver(12, 8, 6);
    console.log(`TEST-7...${result}`);
  
    result = driver(69, 60, 11);
    console.log(`TEST-8...${result}`);
  
    result = driver(78, 21, 1578);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
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 ];
  }