title: Count Number Ways Tile Floor Size N X M Using 1 X M Size Tiles
signature: countNumberWaysTileFloorSizeNXMUsing1XMSizeTiles :: Integer -> Integer -> Integer
  countNumberWaysTileFloorSizeNXMUsing1XMSizeTiles n m = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> Integer -> String
  driver n m expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n m) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (93) (54) (41) )
  
      printf "TEST-1...%s\n" (driver (17) (4) (131) )
  
      printf "TEST-2...%s\n" (driver (38) (39) (1) )
  
      printf "TEST-3...%s\n" (driver (33) (64) (1) )
  
      printf "TEST-4...%s\n" (driver (78) (35) (90) )
  
      printf "TEST-5...%s\n" (driver (40) (61) (1) )
  
      printf "TEST-6...%s\n" (driver (95) (6) (10665883415) )
  
      printf "TEST-7...%s\n" (driver (12) (8) (6) )
  
      printf "TEST-8...%s\n" (driver (69) (60) (11) )
  
      printf "TEST-9...%s\n" (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 ];
  }