title: Number Non Negative Integral Solutions B C N
signature: func numberNonNegativeIntegralSolutionsBCN(n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(62, 2016)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(44, 1035)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(37, 741)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(81, 3403)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(14, 120)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(20, 231)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(76, 3003)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(72, 2701)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(96, 4753)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(52, 1431)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }