Can you explain the modulo exponentiation

#1

i wrote the code for fast power (x^n and splitting n into binary and computing the result) but I was stuck at how to do the mod c part

#2

you can check how to take mod from below code
Reference Code

if you have any doubt in this feel free to ask

#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.