title: Maximum Number Segments Lengths B C
signature: pub fn maximum_number_segments_lengths_b_c(n: i32, a: i32, b: i32, c: 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, a: i32, b: i32, c: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n, a, b, c), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        23, 16, 23, 18, 
        1
      ));
      
      println!("TEST-1...{}", driver(
        62, 76, 81, 97, 
        -1
      ));
      
      println!("TEST-2...{}", driver(
        32, 46, 1, 78, 
        32
      ));
      
      println!("TEST-3...{}", driver(
        82, 48, 72, 58, 
        -1
      ));
      
      println!("TEST-4...{}", driver(
        94, 99, 62, 38, 
        -1
      ));
      
      println!("TEST-5...{}", driver(
        44, 21, 46, 60, 
        -1
      ));
      
      println!("TEST-6...{}", driver(
        4, 57, 2, 77, 
        2
      ));
      
      println!("TEST-7...{}", driver(
        53, 23, 80, 5, 
        7
      ));
      
      println!("TEST-8...{}", driver(
        9, 55, 26, 85, 
        -1
      ));
      
      println!("TEST-9...{}", driver(
        23, 15, 73, 42, 
        -1
      ));
      
  }
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 ];
  }