title: Dice Throw Problem 1
signature: function diceThrowProblem1(f, d, s) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(f, d, s, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(f, d, s),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(57, 5, 33, 35960);
    console.log(`TEST-0...${result}`);
  
    result = driver(58, 45, 4, 0);
    console.log(`TEST-1...${result}`);
  
    result = driver(38, 89, 9, 0);
    console.log(`TEST-2...${result}`);
  
    result = driver(5, 39, 30, 0);
    console.log(`TEST-3...${result}`);
  
    result = driver(91, 90, 47, 0);
    console.log(`TEST-4...${result}`);
  
    result = driver(76, 56, 46, 0);
    console.log(`TEST-5...${result}`);
  
    result = driver(97, 26, 52, 247959266474052);
    console.log(`TEST-6...${result}`);
  
    result = driver(97, 90, 90, 1);
    console.log(`TEST-7...${result}`);
  
    result = driver(99, 2, 26, 25);
    console.log(`TEST-8...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def dice_throw_problem_1(f, d, s):
      mem = [[0 for i in range((s + 1))] for j in range((d + 1))]
      mem[0][0] = 1
      for i in range(1, (d + 1)):
          for j in range(1, (s + 1)):
              mem[i][j] = (mem[i][(j - 1)] + mem[(i - 1)][(j - 1)])
              if (((j - f) - 1) >= 0):
                  mem[i][j] -= mem[(i - 1)][((j - f) - 1)]
      return mem[d][s]
source_cpp: long dice_throw_problem_1(int f, int d, int s) {
    long mem [ d + 1 ] [ s + 1 ];
    memset ( mem, 0, sizeof mem );
    mem [ 0 ] [ 0 ] = 1;
    for ( int i = 1;
    i <= d;
    i ++ ) {
      for ( int j = i;
      j <= s;
      j ++ ) {
        mem [ i ] [ j ] = mem [ i ] [ j - 1 ] + mem [ i - 1 ] [ j - 1 ];
        if ( j - f - 1 >= 0 ) mem [ i ] [ j ] -= mem [ i - 1 ] [ j - f - 1 ];
      }
    }
    return mem [ d ] [ s ];
  }