title: Count Number Of Ways To Cover A Distance 1
signature: fun countNumberOfWaysToCoverADistance1(dist: Int): Long {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Long, expected:Long):Boolean{
    return actual.equals(expected)
  }
  fun driver(dist: Int, expected:Long):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(dist), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(37, 3831006429)
      println("TEST-0...${result}")
      
      result = driver(58, 1383410902447554)
      println("TEST-1...${result}")
      
      result = driver(53, 65720971788709)
      println("TEST-2...${result}")
      
      result = driver(11, 504)
      println("TEST-3...${result}")
      
      result = driver(58, 1383410902447554)
      println("TEST-4...${result}")
      
          
  }
  
  main()
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 ];
  }