title: Dice Throw Problem 1
signature: function dice_throw_problem_1(f, d, s)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(f, d, s, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(f, d, s), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(57, 5, 33, 35960);
      @printf("TEST-0...%s\n",result);
      
      result = driver(58, 45, 4, 0);
      @printf("TEST-1...%s\n",result);
      
      result = driver(38, 89, 9, 0);
      @printf("TEST-2...%s\n",result);
      
      result = driver(5, 39, 30, 0);
      @printf("TEST-3...%s\n",result);
      
      result = driver(91, 90, 47, 0);
      @printf("TEST-4...%s\n",result);
      
      result = driver(76, 56, 46, 0);
      @printf("TEST-5...%s\n",result);
      
      result = driver(97, 26, 52, 247959266474052);
      @printf("TEST-6...%s\n",result);
      
      result = driver(97, 90, 90, 1);
      @printf("TEST-7...%s\n",result);
      
      result = driver(99, 2, 26, 25);
      @printf("TEST-8...%s\n",result);
      
  end
  
  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 ];
  }