title: Find Minimum Number Divided Make Number Perfect Square
signature: findMinimumNumberDividedMakeNumberPerfectSquare(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          95, 
          95)
      }");
  
      print("TEST-1...${driver(
          48, 
          3)
      }");
  
      print("TEST-2...${driver(
          3, 
          3)
      }");
  
      print("TEST-3...${driver(
          10, 
          10)
      }");
  
      print("TEST-4...${driver(
          82, 
          82)
      }");
  
      print("TEST-5...${driver(
          1, 
          1)
      }");
  
      print("TEST-6...${driver(
          77, 
          77)
      }");
  
      print("TEST-7...${driver(
          99, 
          11)
      }");
  
      print("TEST-8...${driver(
          23, 
          23)
      }");
  
      print("TEST-9...${driver(
          61, 
          61)
      }");
  
      return 0;
  }
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;
  }