title: Number Non Negative Integral Solutions B C N
signature: pub fn number_non_negative_integral_solutions_b_c_n(n: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        62, 
        2016
      ));
      
      println!("TEST-1...{}", driver(
        44, 
        1035
      ));
      
      println!("TEST-2...{}", driver(
        37, 
        741
      ));
      
      println!("TEST-3...{}", driver(
        81, 
        3403
      ));
      
      println!("TEST-4...{}", driver(
        14, 
        120
      ));
      
      println!("TEST-5...{}", driver(
        20, 
        231
      ));
      
      println!("TEST-6...{}", driver(
        76, 
        3003
      ));
      
      println!("TEST-7...{}", driver(
        72, 
        2701
      ));
      
      println!("TEST-8...{}", driver(
        96, 
        4753
      ));
      
      println!("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;
  }