[Help] What's the time complexity of dividing (or % mod of) two big numbers?

Revision en1, by ALT__, 2021-02-12 10:08:38

So I was trying to solve this problem: Link

I got a TLE, my submission

I'm not sure if the solution is correct but I want to know why am I getting TLE, I think my solution is O(n), buy maybe because the numbers are too big I'm miscalculating something. I've added comments to my code too please let me know why is getting TLE. Thanks!

Tags #help, #tle

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English ALT__ 2021-02-12 10:08:38 526 Initial revision (published)