title: Count Number Ways Tile Floor Size N X M Using 1 X M Size Tiles
signature: def countNumberWaysTileFloorSizeNXMUsing1XMSizeTiles(n: Int, m: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Long , expected: Long): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(n: Int, m: Int, expected: Long): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n, m),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        93, 54, 
        41L    
      )}")   
  
  
      println(s"TEST-1...${driver(
        17, 4, 
        131L    
      )}")   
  
  
      println(s"TEST-2...${driver(
        38, 39, 
        1L    
      )}")   
  
  
      println(s"TEST-3...${driver(
        33, 64, 
        1L    
      )}")   
  
  
      println(s"TEST-4...${driver(
        78, 35, 
        90L    
      )}")   
  
  
      println(s"TEST-5...${driver(
        40, 61, 
        1L    
      )}")   
  
  
      println(s"TEST-6...${driver(
        95, 6, 
        10665883415L    
      )}")   
  
  
      println(s"TEST-7...${driver(
        12, 8, 
        6L    
      )}")   
  
  
      println(s"TEST-8...${driver(
        69, 60, 
        11L    
      )}")   
  
  
      println(s"TEST-9...${driver(
        78, 21, 
        1578L    
      )}")   
  
  }
  
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 ];
  }