title: Minimum Time Write Characters Using Insert Delete Copy Operation
signature: pub fn minimum_time_write_characters_using_insert_delete_copy_operation(n: i32, insrt: i32, remov: i32, cpy: 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, insrt: i32, remov: i32, cpy: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n, insrt, remov, cpy), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        59, 75, 12, 45, 
        351
      ));
      
      println!("TEST-1...{}", driver(
        66, 68, 32, 41, 
        382
      ));
      
      println!("TEST-2...{}", driver(
        98, 55, 69, 5, 
        195
      ));
      
      println!("TEST-3...{}", driver(
        63, 4, 41, 12, 
        76
      ));
      
      println!("TEST-4...{}", driver(
        99, 37, 98, 55, 
        460
      ));
      
      println!("TEST-5...{}", driver(
        45, 28, 59, 7, 
        147
      ));
      
      println!("TEST-6...{}", driver(
        60, 53, 40, 52, 
        405
      ));
      
      println!("TEST-7...{}", driver(
        11, 96, 50, 50, 
        392
      ));
      
      println!("TEST-8...{}", driver(
        96, 95, 48, 84, 
        694
      ));
      
      println!("TEST-9...{}", driver(
        54, 6, 50, 82, 
        244
      ));
      
  }
source_py: def minimum_time_write_characters_using_insert_delete_copy_operation(N, insrt, remov, cpy):
      if (N == 0):
          return 0
      if (N == 1):
          return insrt
      dp = ([0] * (N + 1))
      for i in range(1, (N + 1)):
          if ((i % 2) == 0):
              dp[i] = min((dp[(i - 1)] + insrt), (dp[(i // 2)] + cpy))
          else:
              dp[i] = min((dp[(i - 1)] + insrt), ((dp[((i + 1) // 2)] + cpy) + remov))
      return dp[N]
source_cpp: int minimum_time_write_characters_using_insert_delete_copy_operation(int N, int insert, int remove, int copy) {
    if ( N == 0 ) return 0;
    if ( N == 1 ) return insert;
    int dp [ N + 1 ];
    memset ( dp, 0, sizeof ( dp ) );
    for ( int i = 1;
    i <= N;
    i ++ ) {
      if ( i % 2 == 0 ) dp [ i ] = min ( dp [ i - 1 ] + insert, dp [ i / 2 ] + copy );
      else dp [ i ] = min ( dp [ i - 1 ] + insert, dp [ ( i + 1 ) / 2 ] + copy + remove );
    }
    return dp [ N ];
  }