title: Maximum Binomial Coefficient Term Value
signature: function maximumBinomialCoefficientTermValue($n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        23, 
        1352078));
      
      printf("TEST-1...%s\n",driver(
        41, 
        269128937220));
      
      printf("TEST-2...%s\n",driver(
        56, 
        7648690600760440));
      
      printf("TEST-3...%s\n",driver(
        38, 
        35345263800));
      
      printf("TEST-4...%s\n",driver(
        26, 
        10400600));
      
      printf("TEST-5...%s\n",driver(
        52, 
        495918532948104));
      
      printf("TEST-6...%s\n",driver(
        44, 
        2104098963720));
      
  }
  
  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;
  }