title: Count Number Ways Tile Floor Size N X M Using 1 X M Size Tiles
signature: countNumberWaysTileFloorSizeNXMUsing1XMSizeTiles(n, m) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, m, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n, m), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          93, 54, 
          41)
      }");
  
      print("TEST-1...${driver(
          17, 4, 
          131)
      }");
  
      print("TEST-2...${driver(
          38, 39, 
          1)
      }");
  
      print("TEST-3...${driver(
          33, 64, 
          1)
      }");
  
      print("TEST-4...${driver(
          78, 35, 
          90)
      }");
  
      print("TEST-5...${driver(
          40, 61, 
          1)
      }");
  
      print("TEST-6...${driver(
          95, 6, 
          10665883415)
      }");
  
      print("TEST-7...${driver(
          12, 8, 
          6)
      }");
  
      print("TEST-8...${driver(
          69, 60, 
          11)
      }");
  
      print("TEST-9...${driver(
          78, 21, 
          1578)
      }");
  
      return 0;
  }
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 ];
  }