title: Count Number Of Ways To Cover A Distance 1
signature: pub fn count_number_of_ways_to_cover_a_distance_1(dist: i32) -> i64 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i64, expected: i64)->bool{
  return actual==expected
  }
  pub fn driver(dist: i32, expected: i64)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(dist), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        37, 
        3831006429
      ));
      
      println!("TEST-1...{}", driver(
        58, 
        1383410902447554
      ));
      
      println!("TEST-2...{}", driver(
        53, 
        65720971788709
      ));
      
      println!("TEST-3...{}", driver(
        11, 
        504
      ));
      
      println!("TEST-4...{}", 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 ];
  }