Https://ide.codingblocks.com/s/267412

#1

why its clearing only 4 testcases

#2

hello @Aditya-Kushwaha-914550392281281
it is because of overflow.
we have well known technique to compute (a^b)%c in log(n).
the name o the algorithm is modular exponentiation.

read it from here-> modular exponentiation and then try to implement on ur own.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.