POWER FUNCTION

CodeChefOpen on judge ↗

Given $a$, $b$ and $mod$, you need to find the value of $POW(a, b)\%mod$. $Note:$ - $1 \leq a \leq 10^X$, where X = 10^5 - $1 \leq b \leq 10^X$, where X = 10^5 - $1 \leq mod \leq 10^9$ $Note:$ Time Multipliers for all the languages are set to 1. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI