title: Count Number Ways Tile Floor Size N X M Using 1 X M Size Tiles
signature: function count_number_ways_tile_floor_size_n_x_m_using_1_x_m_size_tiles(n, m)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, m, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n, m), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(93, 54, 41);
      @printf("TEST-0...%s\n",result);
      
      result = driver(17, 4, 131);
      @printf("TEST-1...%s\n",result);
      
      result = driver(38, 39, 1);
      @printf("TEST-2...%s\n",result);
      
      result = driver(33, 64, 1);
      @printf("TEST-3...%s\n",result);
      
      result = driver(78, 35, 90);
      @printf("TEST-4...%s\n",result);
      
      result = driver(40, 61, 1);
      @printf("TEST-5...%s\n",result);
      
      result = driver(95, 6, 10665883415);
      @printf("TEST-6...%s\n",result);
      
      result = driver(12, 8, 6);
      @printf("TEST-7...%s\n",result);
      
      result = driver(69, 60, 11);
      @printf("TEST-8...%s\n",result);
      
      result = driver(78, 21, 1578);
      @printf("TEST-9...%s\n",result);
      
  end
  
  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 ];
  }