title: Find Minimum Number Divided Make Number Perfect Square
signature: find_minimum_number_divided_make_number_perfect_square <- function(n) {
test_code: 
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  validate_solution <- function(actual, expected) {
      toString(actual)==toString(expected)
  }
  
  driver <- function(n, expected){
      if (validate_solution(PLACEHOLDER_FN_NAME(n), expected)){
          "PASSED"
      } else{
          "FAILED"
      }
  }
  
  main <- function() {
      cat(sprintf("TEST-0...%s\n",driver(
          95L, 
          95L
      )))
  
      cat(sprintf("TEST-1...%s\n",driver(
          48L, 
          3L
      )))
  
      cat(sprintf("TEST-2...%s\n",driver(
          3L, 
          3L
      )))
  
      cat(sprintf("TEST-3...%s\n",driver(
          10L, 
          10L
      )))
  
      cat(sprintf("TEST-4...%s\n",driver(
          82L, 
          82L
      )))
  
      cat(sprintf("TEST-5...%s\n",driver(
          1L, 
          1L
      )))
  
      cat(sprintf("TEST-6...%s\n",driver(
          77L, 
          77L
      )))
  
      cat(sprintf("TEST-7...%s\n",driver(
          99L, 
          11L
      )))
  
      cat(sprintf("TEST-8...%s\n",driver(
          23L, 
          23L
      )))
  
      cat(sprintf("TEST-9...%s\n",driver(
          61L, 
          61L
      )))
  
  }
  
  main()
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;
  }