title: Count Number Ways Reach Given Score Game
signature: countNumberWaysReachGivenScoreGame :: Integer -> Integer
  countNumberWaysReachGivenScoreGame n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (83) (30) )
  
      printf "TEST-1...%s\n" (driver (29) (4) )
  
      printf "TEST-2...%s\n" (driver (17) (1) )
  
      printf "TEST-3...%s\n" (driver (12) (1) )
  
      printf "TEST-4...%s\n" (driver (93) (37) )
  
      printf "TEST-5...%s\n" (driver (55) (16) )
  
      printf "TEST-6...%s\n" (driver (97) (33) )
  
      printf "TEST-7...%s\n" (driver (75) (27) )
  
      printf "TEST-8...%s\n" (driver (22) (2) )
  
      printf "TEST-9...%s\n" (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 ];
  }