title: Count Number Ways Reach Given Score Game
signature: class Solution {
  
      public int CountNumberWaysReachGivenScoreGame(int n) {
test_code: using System;
  using System.Numerics;
  using System.Diagnostics;
  using System.Collections.Generic;
  using System.Linq;
  using System.Text;
  using System.Security.Cryptography;
  using System.Web.UI;
  using System.Web.Script.Serialization;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  namespace EvaluatePrediction {
      class TestRunner {
          public bool ValidateSolution(int actual, int expected){
              return new JavaScriptSerializer().Serialize(actual) == new JavaScriptSerializer().Serialize(expected);
          }
  
          public string driver(int n, int expected){
              try{
                PLACEHOLDER_CLS_NAME solution_cls = new PLACEHOLDER_CLS_NAME();
                int pred_result = solution_cls.PLACEHOLDER_FN_NAME(n); 
                if (ValidateSolution(
                      pred_result,
                      expected)){
                  return "PASSED";
                }
                return "FAILED";
              } 
              catch (Exception exception_obj)
              {
                return exception_obj.GetType().FullName;
              }
          }
          static void Main(string[] args) {
              TestRunner runner = new TestRunner();
              String result;
              result = runner.driver(
                  83, 
                  30
              );
              Console.WriteLine(string.Format(
                  "TEST-0...{0}",
                  result)
              );result = runner.driver(
                  29, 
                  4
              );
              Console.WriteLine(string.Format(
                  "TEST-1...{0}",
                  result)
              );result = runner.driver(
                  17, 
                  1
              );
              Console.WriteLine(string.Format(
                  "TEST-2...{0}",
                  result)
              );result = runner.driver(
                  12, 
                  1
              );
              Console.WriteLine(string.Format(
                  "TEST-3...{0}",
                  result)
              );result = runner.driver(
                  93, 
                  37
              );
              Console.WriteLine(string.Format(
                  "TEST-4...{0}",
                  result)
              );result = runner.driver(
                  55, 
                  16
              );
              Console.WriteLine(string.Format(
                  "TEST-5...{0}",
                  result)
              );result = runner.driver(
                  97, 
                  33
              );
              Console.WriteLine(string.Format(
                  "TEST-6...{0}",
                  result)
              );result = runner.driver(
                  75, 
                  27
              );
              Console.WriteLine(string.Format(
                  "TEST-7...{0}",
                  result)
              );result = runner.driver(
                  22, 
                  2
              );
              Console.WriteLine(string.Format(
                  "TEST-8...{0}",
                  result)
              );result = runner.driver(
                  52, 
                  10
              );
              Console.WriteLine(string.Format(
                  "TEST-9...{0}",
                  result)
              );
          }
      }
  }
  
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 ];
  }