title: Count Number Of Ways To Cover A Distance 1
signature: countNumberOfWaysToCoverADistance1(dist) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(dist, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(dist), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          37, 
          3831006429)
      }");
  
      print("TEST-1...${driver(
          58, 
          1383410902447554)
      }");
  
      print("TEST-2...${driver(
          53, 
          65720971788709)
      }");
  
      print("TEST-3...${driver(
          11, 
          504)
      }");
  
      print("TEST-4...${driver(
          58, 
          1383410902447554)
      }");
  
      return 0;
  }
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 ];
  }