title: Count Number Ways Tile Floor Size N X M Using 1 X M Size Tiles
signature: func countNumberWaysTileFloorSizeNXMUsing1XMSizeTiles(n int, m int) int64 {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int64, expected int64) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, m int, expected int64) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n, m),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(93, 
  	54, 41)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(17, 
  	4, 131)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(38, 
  	39, 1)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(33, 
  	64, 1)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(78, 
  	35, 90)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(40, 
  	61, 1)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(95, 
  	6, 10665883415)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(12, 
  	8, 6)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(69, 
  	60, 11)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(78, 
  	21, 1578)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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 ];
  }