title: Dice Throw Problem 1
signature: diceThrowProblem1(f, d, s) {
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(f, d, s, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(f, d, s), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          57, 5, 33, 
          35960)
      }");
  
      print("TEST-1...${driver(
          58, 45, 4, 
          0)
      }");
  
      print("TEST-2...${driver(
          38, 89, 9, 
          0)
      }");
  
      print("TEST-3...${driver(
          5, 39, 30, 
          0)
      }");
  
      print("TEST-4...${driver(
          91, 90, 47, 
          0)
      }");
  
      print("TEST-5...${driver(
          76, 56, 46, 
          0)
      }");
  
      print("TEST-6...${driver(
          97, 26, 52, 
          247959266474052)
      }");
  
      print("TEST-7...${driver(
          97, 90, 90, 
          1)
      }");
  
      print("TEST-8...${driver(
          99, 2, 26, 
          25)
      }");
  
      return 0;
  }
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 ];
  }