title: Find Minimum Number Divided Make Number Perfect Square
signature: class Solution {
  
      public Integer findMinimumNumberDividedMakeNumberPerfectSquare(Integer n) {
test_code: import static java.util.Map.entry;  
  import java.util.*;
  import java.lang.*;
  // TESTING CODE 
  // ============================================
  class QuestionEvaluator {
      public static String validateSolution(Integer n, Integer expected){
          try{
              Driver driver = new Driver();
              if (driver.run(n,expected)){
                  return "PASSED";
              }
              return "FAILED";
              
          } catch (Exception exception_obj){
              return exception_obj.getClass().getSimpleName();
          }
  
      }
      public static void main(String[] args) {
          String result;
          result = validateSolution(95, 95);
          System.out.println(String.format("%s%s","TEST-0...",result));    
      
          result = validateSolution(48, 3);
          System.out.println(String.format("%s%s","TEST-1...",result));    
      
          result = validateSolution(3, 3);
          System.out.println(String.format("%s%s","TEST-2...",result));    
      
          result = validateSolution(10, 10);
          System.out.println(String.format("%s%s","TEST-3...",result));    
      
          result = validateSolution(82, 82);
          System.out.println(String.format("%s%s","TEST-4...",result));    
      
          result = validateSolution(1, 1);
          System.out.println(String.format("%s%s","TEST-5...",result));    
      
          result = validateSolution(77, 77);
          System.out.println(String.format("%s%s","TEST-6...",result));    
      
          result = validateSolution(99, 11);
          System.out.println(String.format("%s%s","TEST-7...",result));    
      
          result = validateSolution(23, 23);
          System.out.println(String.format("%s%s","TEST-8...",result));    
      
          result = validateSolution(61, 61);
          System.out.println(String.format("%s%s","TEST-9...",result));    
      
      }
  }
  
  class Driver{
      public boolean run(Integer n, Integer expected){
  
          PLACEHOLDER_CLS_NAME sol = new PLACEHOLDER_CLS_NAME();
          return validateSolution(sol.PLACEHOLDER_FN_NAME(n),expected);
      }
      
      public boolean validateSolution(Integer actual, Integer expected){
          return actual.equals(expected);
      }
  }
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
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;
  }