Why it is showing TLE in O(N Log N) complexity?

#1

this is my code

#2

hello @abhi542136

once try using iterative modulo exponentiation

#3

still not working…

#4

ok ok
I forgot to use %p…
now it is working… thanks
…
But, why my 1st code was not working even in (N Log N) time?

#5

…

recursive function are generally slow becuase of function calls

#6

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.