title: Count Number Ways Reach Given Score Game
signature: pub fn count_number_ways_reach_given_score_game(n: i32) -> i32 {
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: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        83, 
        30
      ));
      
      println!("TEST-1...{}", driver(
        29, 
        4
      ));
      
      println!("TEST-2...{}", driver(
        17, 
        1
      ));
      
      println!("TEST-3...{}", driver(
        12, 
        1
      ));
      
      println!("TEST-4...{}", driver(
        93, 
        37
      ));
      
      println!("TEST-5...{}", driver(
        55, 
        16
      ));
      
      println!("TEST-6...{}", driver(
        97, 
        33
      ));
      
      println!("TEST-7...{}", driver(
        75, 
        27
      ));
      
      println!("TEST-8...{}", driver(
        22, 
        2
      ));
      
      println!("TEST-9...{}", driver(
        52, 
        10
      ));
      
  }
source_py: def count_number_ways_reach_given_score_game(n):
      table = [0 for i in range((n + 1))]
      table[0] = 1
      for i in range(3, (n + 1)):
          table[i] += table[(i - 3)]
      for i in range(5, (n + 1)):
          table[i] += table[(i - 5)]
      for i in range(10, (n + 1)):
          table[i] += table[(i - 10)]
      return table[n]
source_cpp: int count_number_ways_reach_given_score_game(int n) {
    int table [ n + 1 ], i;
    for ( int j = 0;
    j < n + 1;
    j ++ ) table [ j ] = 0;
    table [ 0 ] = 1;
    for ( i = 3;
    i <= n;
    i ++ ) table [ i ] += table [ i - 3 ];
    for ( i = 5;
    i <= n;
    i ++ ) table [ i ] += table [ i - 5 ];
    for ( i = 10;
    i <= n;
    i ++ ) table [ i ] += table [ i - 10 ];
    return table [ n ];
  }