title: Maximum Number Segments Lengths B C
signature: function maximumNumberSegmentsLengthsBC($n, $a, $b, $c) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($n, $a, $b, $c, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($n, $a, $b, $c), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        23, 16, 23, 18, 
        1));
      
      printf("TEST-1...%s\n",driver(
        62, 76, 81, 97, 
        -1));
      
      printf("TEST-2...%s\n",driver(
        32, 46, 1, 78, 
        32));
      
      printf("TEST-3...%s\n",driver(
        82, 48, 72, 58, 
        -1));
      
      printf("TEST-4...%s\n",driver(
        94, 99, 62, 38, 
        -1));
      
      printf("TEST-5...%s\n",driver(
        44, 21, 46, 60, 
        -1));
      
      printf("TEST-6...%s\n",driver(
        4, 57, 2, 77, 
        2));
      
      printf("TEST-7...%s\n",driver(
        53, 23, 80, 5, 
        7));
      
      printf("TEST-8...%s\n",driver(
        9, 55, 26, 85, 
        -1));
      
      printf("TEST-9...%s\n",driver(
        23, 15, 73, 42, 
        -1));
      
  }
  
  main();
  ?>
source_py: def maximum_number_segments_lengths_b_c(n, a, b, c):
      dp = ([(- 1)] * (n + 10))
      dp[0] = 0
      for i in range(0, n):
          if (dp[i] != (- 1)):
              if ((i + a) <= n):
                  dp[(i + a)] = max((dp[i] + 1), dp[(i + a)])
              if ((i + b) <= n):
                  dp[(i + b)] = max((dp[i] + 1), dp[(i + b)])
              if ((i + c) <= n):
                  dp[(i + c)] = max((dp[i] + 1), dp[(i + c)])
      return dp[n]
source_cpp: int maximum_number_segments_lengths_b_c(int n, int a, int b, int c) {
    int dp [ n + 1 ];
    memset ( dp, - 1, sizeof ( dp ) );
    dp [ 0 ] = 0;
    for ( int i = 0;
    i < n;
    i ++ ) {
      if ( dp [ i ] != - 1 ) {
        if ( i + a <= n ) dp [ i + a ] = max ( dp [ i ] + 1, dp [ i + a ] );
        if ( i + b <= n ) dp [ i + b ] = max ( dp [ i ] + 1, dp [ i + b ] );
        if ( i + c <= n ) dp [ i + c ] = max ( dp [ i ] + 1, dp [ i + c ] );
      }
    }
    return dp [ n ];
  }