title: Number Non Negative Integral Solutions B C N
signature: function numberNonNegativeIntegralSolutionsBCN($n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        62, 
        2016));
      
      printf("TEST-1...%s\n",driver(
        44, 
        1035));
      
      printf("TEST-2...%s\n",driver(
        37, 
        741));
      
      printf("TEST-3...%s\n",driver(
        81, 
        3403));
      
      printf("TEST-4...%s\n",driver(
        14, 
        120));
      
      printf("TEST-5...%s\n",driver(
        20, 
        231));
      
      printf("TEST-6...%s\n",driver(
        76, 
        3003));
      
      printf("TEST-7...%s\n",driver(
        72, 
        2701));
      
      printf("TEST-8...%s\n",driver(
        96, 
        4753));
      
      printf("TEST-9...%s\n",driver(
        52, 
        1431));
      
  }
  
  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;
  }