title: Count Number Of Ways To Cover A Distance 1
signature: func countNumberOfWaysToCoverADistance1(dist 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(dist int, expected int64) string {
      if validateSolution(PLACEHOLDER_FN_NAME(dist),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(37, 3831006429)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(58, 1383410902447554)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(53, 65720971788709)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(11, 504)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(58, 1383410902447554)
      fmt.Printf("TEST-4...%s\n", result)
      
          
  }
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 ];
  }