title: Number Non Negative Integral Solutions B C N
signature: numberNonNegativeIntegralSolutionsBCN(n) {
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(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          62, 
          2016)
      }");
  
      print("TEST-1...${driver(
          44, 
          1035)
      }");
  
      print("TEST-2...${driver(
          37, 
          741)
      }");
  
      print("TEST-3...${driver(
          81, 
          3403)
      }");
  
      print("TEST-4...${driver(
          14, 
          120)
      }");
  
      print("TEST-5...${driver(
          20, 
          231)
      }");
  
      print("TEST-6...${driver(
          76, 
          3003)
      }");
  
      print("TEST-7...${driver(
          72, 
          2701)
      }");
  
      print("TEST-8...${driver(
          96, 
          4753)
      }");
  
      print("TEST-9...${driver(
          52, 
          1431)
      }");
  
      return 0;
  }
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;
  }