title: Minimum Time Write Characters Using Insert Delete Copy Operation
signature: minimumTimeWriteCharactersUsingInsertDeleteCopyOperation(n, insrt, remov, cpy) {
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, insrt, remov, cpy, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n, insrt, remov, cpy), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          59, 75, 12, 45, 
          351)
      }");
  
      print("TEST-1...${driver(
          66, 68, 32, 41, 
          382)
      }");
  
      print("TEST-2...${driver(
          98, 55, 69, 5, 
          195)
      }");
  
      print("TEST-3...${driver(
          63, 4, 41, 12, 
          76)
      }");
  
      print("TEST-4...${driver(
          99, 37, 98, 55, 
          460)
      }");
  
      print("TEST-5...${driver(
          45, 28, 59, 7, 
          147)
      }");
  
      print("TEST-6...${driver(
          60, 53, 40, 52, 
          405)
      }");
  
      print("TEST-7...${driver(
          11, 96, 50, 50, 
          392)
      }");
  
      print("TEST-8...${driver(
          96, 95, 48, 84, 
          694)
      }");
  
      print("TEST-9...${driver(
          54, 6, 50, 82, 
          244)
      }");
  
      return 0;
  }
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 ];
  }