title: Find Minimum Number Divided Make Number Perfect Square
signature: pub fn find_minimum_number_divided_make_number_perfect_square(n: 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, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        95, 
        95
      ));
      
      println!("TEST-1...{}", driver(
        48, 
        3
      ));
      
      println!("TEST-2...{}", driver(
        3, 
        3
      ));
      
      println!("TEST-3...{}", driver(
        10, 
        10
      ));
      
      println!("TEST-4...{}", driver(
        82, 
        82
      ));
      
      println!("TEST-5...{}", driver(
        1, 
        1
      ));
      
      println!("TEST-6...{}", driver(
        77, 
        77
      ));
      
      println!("TEST-7...{}", driver(
        99, 
        11
      ));
      
      println!("TEST-8...{}", driver(
        23, 
        23
      ));
      
      println!("TEST-9...{}", driver(
        61, 
        61
      ));
      
  }
source_py: def find_minimum_number_divided_make_number_perfect_square(n):
      count = 0
      ans = 1
      while ((n % 2) == 0):
          count += 1
          n //= 2
      if ((count % 2) is not 0):
          ans *= 2
      for i in range(3, (int(math.sqrt(n)) + 1), 2):
          count = 0
          while ((n % i) == 0):
              count += 1
              n //= i
          if ((count % 2) is not 0):
              ans *= i
      if (n > 2):
          ans *= n
      return ans
source_cpp: int find_minimum_number_divided_make_number_perfect_square(int n) {
    int count = 0, ans = 1;
    while ( n % 2 == 0 ) {
      count ++;
      n /= 2;
    }
    if ( count % 2 ) ans *= 2;
    for ( int i = 3;
    i <= sqrt ( n );
    i += 2 ) {
      count = 0;
      while ( n % i == 0 ) {
        count ++;
        n /= i;
      }
      if ( count % 2 ) ans *= i;
    }
    if ( n > 2 ) ans *= n;
    return ans;
  }