title: Number Non Negative Integral Solutions B C N
signature: function number_non_negative_integral_solutions_b_c_n(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(62, 2016);
      @printf("TEST-0...%s\n",result);
      
      result = driver(44, 1035);
      @printf("TEST-1...%s\n",result);
      
      result = driver(37, 741);
      @printf("TEST-2...%s\n",result);
      
      result = driver(81, 3403);
      @printf("TEST-3...%s\n",result);
      
      result = driver(14, 120);
      @printf("TEST-4...%s\n",result);
      
      result = driver(20, 231);
      @printf("TEST-5...%s\n",result);
      
      result = driver(76, 3003);
      @printf("TEST-6...%s\n",result);
      
      result = driver(72, 2701);
      @printf("TEST-7...%s\n",result);
      
      result = driver(96, 4753);
      @printf("TEST-8...%s\n",result);
      
      result = driver(52, 1431);
      @printf("TEST-9...%s\n",result);
      
  end
  
  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;
  }