title: Find Minimum Number Divided Make Number Perfect Square
signature: findMinimumNumberDividedMakeNumberPerfectSquare :: Integer -> Integer
  findMinimumNumberDividedMakeNumberPerfectSquare n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (95) (95) )
  
      printf "TEST-1...%s\n" (driver (48) (3) )
  
      printf "TEST-2...%s\n" (driver (3) (3) )
  
      printf "TEST-3...%s\n" (driver (10) (10) )
  
      printf "TEST-4...%s\n" (driver (82) (82) )
  
      printf "TEST-5...%s\n" (driver (1) (1) )
  
      printf "TEST-6...%s\n" (driver (77) (77) )
  
      printf "TEST-7...%s\n" (driver (99) (11) )
  
      printf "TEST-8...%s\n" (driver (23) (23) )
  
      printf "TEST-9...%s\n" (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;
  }