title: Find Minimum Number Divided Make Number Perfect Square
signature: class Solution {
  
      public int FindMinimumNumberDividedMakeNumberPerfectSquare(int n) {
test_code: using System;
  using System.Numerics;
  using System.Diagnostics;
  using System.Collections.Generic;
  using System.Linq;
  using System.Text;
  using System.Security.Cryptography;
  using System.Web.UI;
  using System.Web.Script.Serialization;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  namespace EvaluatePrediction {
      class TestRunner {
          public bool ValidateSolution(int actual, int expected){
              return new JavaScriptSerializer().Serialize(actual) == new JavaScriptSerializer().Serialize(expected);
          }
  
          public string driver(int n, int expected){
              try{
                PLACEHOLDER_CLS_NAME solution_cls = new PLACEHOLDER_CLS_NAME();
                int pred_result = solution_cls.PLACEHOLDER_FN_NAME(n); 
                if (ValidateSolution(
                      pred_result,
                      expected)){
                  return "PASSED";
                }
                return "FAILED";
              } 
              catch (Exception exception_obj)
              {
                return exception_obj.GetType().FullName;
              }
          }
          static void Main(string[] args) {
              TestRunner runner = new TestRunner();
              String result;
              result = runner.driver(
                  95, 
                  95
              );
              Console.WriteLine(string.Format(
                  "TEST-0...{0}",
                  result)
              );result = runner.driver(
                  48, 
                  3
              );
              Console.WriteLine(string.Format(
                  "TEST-1...{0}",
                  result)
              );result = runner.driver(
                  3, 
                  3
              );
              Console.WriteLine(string.Format(
                  "TEST-2...{0}",
                  result)
              );result = runner.driver(
                  10, 
                  10
              );
              Console.WriteLine(string.Format(
                  "TEST-3...{0}",
                  result)
              );result = runner.driver(
                  82, 
                  82
              );
              Console.WriteLine(string.Format(
                  "TEST-4...{0}",
                  result)
              );result = runner.driver(
                  1, 
                  1
              );
              Console.WriteLine(string.Format(
                  "TEST-5...{0}",
                  result)
              );result = runner.driver(
                  77, 
                  77
              );
              Console.WriteLine(string.Format(
                  "TEST-6...{0}",
                  result)
              );result = runner.driver(
                  99, 
                  11
              );
              Console.WriteLine(string.Format(
                  "TEST-7...{0}",
                  result)
              );result = runner.driver(
                  23, 
                  23
              );
              Console.WriteLine(string.Format(
                  "TEST-8...{0}",
                  result)
              );result = runner.driver(
                  61, 
                  61
              );
              Console.WriteLine(string.Format(
                  "TEST-9...{0}",
                  result)
              );
          }
      }
  }
  
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;
  }