title: Number Non Negative Integral Solutions B C N
signature: def numberNonNegativeIntegralSolutionsBCN(n: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(n: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        62, 
        2016    
      )}")   
  
  
      println(s"TEST-1...${driver(
        44, 
        1035    
      )}")   
  
  
      println(s"TEST-2...${driver(
        37, 
        741    
      )}")   
  
  
      println(s"TEST-3...${driver(
        81, 
        3403    
      )}")   
  
  
      println(s"TEST-4...${driver(
        14, 
        120    
      )}")   
  
  
      println(s"TEST-5...${driver(
        20, 
        231    
      )}")   
  
  
      println(s"TEST-6...${driver(
        76, 
        3003    
      )}")   
  
  
      println(s"TEST-7...${driver(
        72, 
        2701    
      )}")   
  
  
      println(s"TEST-8...${driver(
        96, 
        4753    
      )}")   
  
  
      println(s"TEST-9...${driver(
        52, 
        1431    
      )}")   
  
  }
  
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;
  }