title: Minimum Time Write Characters Using Insert Delete Copy Operation
signature: function minimumTimeWriteCharactersUsingInsertDeleteCopyOperation($n, $insrt, $remov, $cpy) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($n, $insrt, $remov, $cpy, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($n, $insrt, $remov, $cpy), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        59, 75, 12, 45, 
        351));
      
      printf("TEST-1...%s\n",driver(
        66, 68, 32, 41, 
        382));
      
      printf("TEST-2...%s\n",driver(
        98, 55, 69, 5, 
        195));
      
      printf("TEST-3...%s\n",driver(
        63, 4, 41, 12, 
        76));
      
      printf("TEST-4...%s\n",driver(
        99, 37, 98, 55, 
        460));
      
      printf("TEST-5...%s\n",driver(
        45, 28, 59, 7, 
        147));
      
      printf("TEST-6...%s\n",driver(
        60, 53, 40, 52, 
        405));
      
      printf("TEST-7...%s\n",driver(
        11, 96, 50, 50, 
        392));
      
      printf("TEST-8...%s\n",driver(
        96, 95, 48, 84, 
        694));
      
      printf("TEST-9...%s\n",driver(
        54, 6, 50, 82, 
        244));
      
  }
  
  main();
  ?>
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 ];
  }