title: Minimum Operations Make Gcd Array Multiple K
signature: function minimumOperationsMakeGcdArrayMultipleK(a, n, k) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(a, n, k, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(a, n, k),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver([3, 7, 27, 32, 36, 37, 44, 48, 50, 64, 86], 5, 10, 19);
    console.log(`TEST-0...${result}`);
  
    result = driver([-22, 6, -20, 60, -74, 98, 52, -22], 5, 4, 130);
    console.log(`TEST-1...${result}`);
  
    result = driver([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], 23, 29, 661);
    console.log(`TEST-2...${result}`);
  
    result = driver([77, 11, 51, 11, 84, 79, 43, 12, 14, 50, 15, 6, 85, 32, 74, 49, 7, 2, 58], 9, 17, 43);
    console.log(`TEST-3...${result}`);
  
    result = driver([-90, -66, -64, -58, -46, -44, -32, -30, -30, -22, -18, -14, 12, 12, 18, 34, 44, 60, 70, 70, 74, 76, 86, 98, 98], 12, 22, 778);
    console.log(`TEST-4...${result}`);
  
    result = driver([1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1], 36, 31, 1096);
    console.log(`TEST-5...${result}`);
  
    result = driver([9, 22, 27, 27, 37, 53, 53, 56, 63, 73, 76, 81, 82], 10, 11, 28);
    console.log(`TEST-6...${result}`);
  
    result = driver([-46, 60, 80, 80, 42, -98, 30, -48, 4, -32, -78, 40, 52, 26, 88, 4, 22, 62, 88, -94, 2, 0, 58, 38, 52, -50, -52, 58, -62, 30, -38, -8, -82, -66], 18, 19, 479);
    console.log(`TEST-7...${result}`);
  
    result = driver([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], 19, 22, 413);
    console.log(`TEST-8...${result}`);
  
    result = driver([42, 69, 93, 82, 8, 23, 73, 1, 77, 39, 49, 4, 95, 85], 12, 13, 51);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def minimum_operations_make_gcd_array_multiple_k(a, n, k):
      result = 0
      for i in range(n):
          if ((a[i] != 1) and (a[i] > k)):
              result = (result + min((a[i] % k), (k - (a[i] % k))))
          else:
              result = ((result + k) - a[i])
      return result
source_cpp: int minimum_operations_make_gcd_array_multiple_k(vector<int> a, int n, int k) {
    int result = 0;
    for ( int i = 0;
    i < n;
    ++ i ) {
      if ( a [ i ] != 1 && a [ i ] > k ) {
        result = result + min ( a [ i ] % k, k - a [ i ] % k );
      }
      else {
        result = result + k - a [ i ];
      }
    }
    return result;
  }