title: Count Number Of Ways To Cover A Distance 1
signature: countNumberOfWaysToCoverADistance1 :: Integer -> Integer
  countNumberOfWaysToCoverADistance1 dist = 
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 -> String
  driver dist expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME dist) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (37) (3831006429) )
  
      printf "TEST-1...%s\n" (driver (58) (1383410902447554) )
  
      printf "TEST-2...%s\n" (driver (53) (65720971788709) )
  
      printf "TEST-3...%s\n" (driver (11) (504) )
  
      printf "TEST-4...%s\n" (driver (58) (1383410902447554) )
  
source_py: def count_number_of_ways_to_cover_a_distance_1(dist):
      count = ([0] * (dist + 1))
      count[0] = 1
      count[1] = 1
      count[2] = 2
      for i in range(3, (dist + 1)):
          count[i] = ((count[(i - 1)] + count[(i - 2)]) + count[(i - 3)])
      return count[dist]
source_cpp: int count_number_of_ways_to_cover_a_distance_1(int dist) {
    int count [ dist + 1 ];
    count [ 0 ] = 1, count [ 1 ] = 1, count [ 2 ] = 2;
    for ( int i = 3;
    i <= dist;
    i ++ ) count [ i ] = count [ i - 1 ] + count [ i - 2 ] + count [ i - 3 ];
    return count [ dist ];
  }