title: Number Non Negative Integral Solutions B C N
signature: function numberNonNegativeIntegralSolutionsBCN(n) {
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(n, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(62, 2016);
    console.log(`TEST-0...${result}`);
  
    result = driver(44, 1035);
    console.log(`TEST-1...${result}`);
  
    result = driver(37, 741);
    console.log(`TEST-2...${result}`);
  
    result = driver(81, 3403);
    console.log(`TEST-3...${result}`);
  
    result = driver(14, 120);
    console.log(`TEST-4...${result}`);
  
    result = driver(20, 231);
    console.log(`TEST-5...${result}`);
  
    result = driver(76, 3003);
    console.log(`TEST-6...${result}`);
  
    result = driver(72, 2701);
    console.log(`TEST-7...${result}`);
  
    result = driver(96, 4753);
    console.log(`TEST-8...${result}`);
  
    result = driver(52, 1431);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def number_non_negative_integral_solutions_b_c_n(n):
      result = 0
      for i in range((n + 1)):
          for j in range((n + 1)):
              for k in range((n + 1)):
                  if (((i + j) + k) == n):
                      result += 1
      return result
source_cpp: int number_non_negative_integral_solutions_b_c_n(int n) {
    int result = 0;
    for ( int i = 0;
    i <= n;
    i ++ ) for ( int j = 0;
    j <= n - i;
    j ++ ) for ( int k = 0;
    k <= ( n - i - j );
    k ++ ) if ( i + j + k == n ) result ++;
    return result;
  }