title: Count Number Ways Reach Given Score Game
signature: countNumberWaysReachGivenScoreGame(n) {
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(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          83, 
          30)
      }");
  
      print("TEST-1...${driver(
          29, 
          4)
      }");
  
      print("TEST-2...${driver(
          17, 
          1)
      }");
  
      print("TEST-3...${driver(
          12, 
          1)
      }");
  
      print("TEST-4...${driver(
          93, 
          37)
      }");
  
      print("TEST-5...${driver(
          55, 
          16)
      }");
  
      print("TEST-6...${driver(
          97, 
          33)
      }");
  
      print("TEST-7...${driver(
          75, 
          27)
      }");
  
      print("TEST-8...${driver(
          22, 
          2)
      }");
  
      print("TEST-9...${driver(
          52, 
          10)
      }");
  
      return 0;
  }
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 ];
  }