title: Modular Exponentiation Power In Modular Arithmetic
signature: fun modularExponentiationPowerInModularArithmetic(x: Int, y: Int, p: Int): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(x: Int, y: Int, p: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(x, y, p), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(45, 5, 68, 61)
      println("TEST-0...${result}")
      
      result = driver(67, 25, 49, 18)
      println("TEST-1...${result}")
      
      result = driver(26, 91, 44, 4)
      println("TEST-2...${result}")
      
      result = driver(33, 61, 9, 0)
      println("TEST-3...${result}")
      
      result = driver(35, 8, 13, 3)
      println("TEST-4...${result}")
      
      result = driver(68, 41, 5, 3)
      println("TEST-5...${result}")
      
      result = driver(14, 76, 20, 16)
      println("TEST-6...${result}")
      
      result = driver(5, 89, 13, 5)
      println("TEST-7...${result}")
      
      result = driver(23, 42, 45, 19)
      println("TEST-8...${result}")
      
      result = driver(37, 63, 56, 29)
      println("TEST-9...${result}")
      
          
  }
  
  main()
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;
  }