title: Modular Exponentiation Power In Modular Arithmetic
signature: int modularExponentiationPowerInModularArithmetic(int x, int y, 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(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int x, int y, int p, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(x, y, 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(45, 5, 68, 61); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(67, 25, 49, 18); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(26, 91, 44, 4); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(33, 61, 9, 0); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(35, 8, 13, 3); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(68, 41, 5, 3); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(14, 76, 20, 16); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(5, 89, 13, 5); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(23, 42, 45, 19); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(37, 63, 56, 29); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def modular_exponentiation_power_in_modular_arithmetic(x, y, p):
      res = 1
      x = (x % p)
      while (y > 0):
          if ((y & 1) == 1):
              res = ((res * x) % p)
          y = (y >> 1)
          x = ((x * x) % p)
      return res
source_cpp: int modular_exponentiation_power_in_modular_arithmetic(int x, unsigned int y, int p) {
    int res = 1;
    x = x % p;
    while ( y > 0 ) {
      if ( y & 1 ) res = ( res * x ) % p;
      y = y >> 1;
      x = ( x * x ) % p;
    }
    return res;
  }