title: Minimum Operations Make Gcd Array Multiple K
signature: pub fn minimum_operations_make_gcd_array_multiple_k(a: Vec<i32>, n: i32, k: 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(a: Vec<i32>, n: i32, k: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(a, n, k), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        Vec::from([3, 7, 27, 32, 36, 37, 44, 48, 50, 64, 86]), 5, 10, 
        19
      ));
      
      println!("TEST-1...{}", driver(
        Vec::from([-22, 6, -20, 60, -74, 98, 52, -22]), 5, 4, 
        130
      ));
      
      println!("TEST-2...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-3...{}", driver(
        Vec::from([77, 11, 51, 11, 84, 79, 43, 12, 14, 50, 15, 6, 85, 32, 74, 49, 7, 2, 58]), 9, 17, 
        43
      ));
      
      println!("TEST-4...{}", driver(
        Vec::from([-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
      ));
      
      println!("TEST-5...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-6...{}", driver(
        Vec::from([9, 22, 27, 27, 37, 53, 53, 56, 63, 73, 76, 81, 82]), 10, 11, 
        28
      ));
      
      println!("TEST-7...{}", driver(
        Vec::from([-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
      ));
      
      println!("TEST-8...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-9...{}", driver(
        Vec::from([42, 69, 93, 82, 8, 23, 73, 1, 77, 39, 49, 4, 95, 85]), 12, 13, 
        51
      ));
      
  }
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;
  }