title: Count Number Of Ways To Cover A Distance 1
signature: function count_number_of_ways_to_cover_a_distance_1(dist)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(dist, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(dist), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(37, 3831006429);
      @printf("TEST-0...%s\n",result);
      
      result = driver(58, 1383410902447554);
      @printf("TEST-1...%s\n",result);
      
      result = driver(53, 65720971788709);
      @printf("TEST-2...%s\n",result);
      
      result = driver(11, 504);
      @printf("TEST-3...%s\n",result);
      
      result = driver(58, 1383410902447554);
      @printf("TEST-4...%s\n",result);
      
  end
  
  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 ];
  }