title: Maximum Number Segments Lengths B C
signature: maximumNumberSegmentsLengthsBC(n, a, b, c) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, a, b, c, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n, a, b, c), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          23, 16, 23, 18, 
          1)
      }");
  
      print("TEST-1...${driver(
          62, 76, 81, 97, 
          -1)
      }");
  
      print("TEST-2...${driver(
          32, 46, 1, 78, 
          32)
      }");
  
      print("TEST-3...${driver(
          82, 48, 72, 58, 
          -1)
      }");
  
      print("TEST-4...${driver(
          94, 99, 62, 38, 
          -1)
      }");
  
      print("TEST-5...${driver(
          44, 21, 46, 60, 
          -1)
      }");
  
      print("TEST-6...${driver(
          4, 57, 2, 77, 
          2)
      }");
  
      print("TEST-7...${driver(
          53, 23, 80, 5, 
          7)
      }");
  
      print("TEST-8...${driver(
          9, 55, 26, 85, 
          -1)
      }");
  
      print("TEST-9...${driver(
          23, 15, 73, 42, 
          -1)
      }");
  
      return 0;
  }
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 ];
  }