title: Maximum Binomial Coefficient Term Value
signature: maximum_binomial_coefficient_term_value <- function(n) {
test_code: 
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  validate_solution <- function(actual, expected) {
      toString(actual)==toString(expected)
  }
  
  driver <- function(n, expected){
      if (validate_solution(PLACEHOLDER_FN_NAME(n), expected)){
          "PASSED"
      } else{
          "FAILED"
      }
  }
  
  main <- function() {
      cat(sprintf("TEST-0...%s\n",driver(
          23L, 
          1352078L
      )))
  
      cat(sprintf("TEST-1...%s\n",driver(
          41L, 
          269128937220L
      )))
  
      cat(sprintf("TEST-2...%s\n",driver(
          56L, 
          7648690600760440L
      )))
  
      cat(sprintf("TEST-3...%s\n",driver(
          38L, 
          35345263800L
      )))
  
      cat(sprintf("TEST-4...%s\n",driver(
          26L, 
          10400600L
      )))
  
      cat(sprintf("TEST-5...%s\n",driver(
          52L, 
          495918532948104L
      )))
  
      cat(sprintf("TEST-6...%s\n",driver(
          44L, 
          2104098963720L
      )))
  
  }
  
  main()
source_py: def maximum_binomial_coefficient_term_value(n):
      C = [[0 for x in range((n + 1))] for y in range((n + 1))]
      for i in range((n + 1)):
          for j in range((min(i, n) + 1)):
              if ((j == 0) or (j == i)):
                  C[i][j] = 1
              else:
                  C[i][j] = (C[(i - 1)][(j - 1)] + C[(i - 1)][j])
      maxvalue = 0
      for i in range((n + 1)):
          maxvalue = max(maxvalue, C[n][i])
      return maxvalue
source_cpp: int maximum_binomial_coefficient_term_value(int n) {
    int C [ n + 1 ] [ n + 1 ];
    for ( int i = 0;
    i <= n;
    i ++ ) {
      for ( int j = 0;
      j <= min ( i, n );
      j ++ ) {
        if ( j == 0 || j == i ) C [ i ] [ j ] = 1;
        else C [ i ] [ j ] = C [ i - 1 ] [ j - 1 ] + C [ i - 1 ] [ j ];
      }
    }
    int maxvalue = 0;
    for ( int i = 0;
    i <= n;
    i ++ ) maxvalue = max ( maxvalue, C [ n ] [ i ] );
    return maxvalue;
  }