title: Eulers Criterion Check If Square Root Under Modulo P Exists
signature: bool eulersCriterionCheckIfSquareRootUnderModuloPExists(int n, int p) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(bool actual, bool expected){
      return actual == expected;
  }
  
  string driver(int n, int p, bool expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n, p), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(71, 78, false); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(85, 75, false); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(4, 35, true); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(20, 99, false); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(71, 29, true); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(72, 88, false); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(36, 54, true); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(95, 52, false); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(83, 33, false); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(72, 13, false); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def eulers_criterion_check_if_square_root_under_modulo_p_exists(n, p):
      n = (n % p)
      for x in range(2, p, 1):
          if (((x * x) % p) == n):
              return True
      return False
source_cpp: bool eulers_criterion_check_if_square_root_under_modulo_p_exists(int n, int p) {
    n = n % p;
    for ( int x = 2;
    x < p;
    x ++ ) if ( ( x * x ) % p == n ) return true;
    return false;
  }