title: Find Minimum Number Divided Make Number Perfect Square
signature: def findMinimumNumberDividedMakeNumberPerfectSquare(n: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(n: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        95, 
        95    
      )}")   
  
  
      println(s"TEST-1...${driver(
        48, 
        3    
      )}")   
  
  
      println(s"TEST-2...${driver(
        3, 
        3    
      )}")   
  
  
      println(s"TEST-3...${driver(
        10, 
        10    
      )}")   
  
  
      println(s"TEST-4...${driver(
        82, 
        82    
      )}")   
  
  
      println(s"TEST-5...${driver(
        1, 
        1    
      )}")   
  
  
      println(s"TEST-6...${driver(
        77, 
        77    
      )}")   
  
  
      println(s"TEST-7...${driver(
        99, 
        11    
      )}")   
  
  
      println(s"TEST-8...${driver(
        23, 
        23    
      )}")   
  
  
      println(s"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;
  }