ABX01 - EDITORIAL

mr_cyborg · January 2, 2018, 5:22pm

We can use "set stl " also

eugalt · January 2, 2018, 10:50pm

O(no of digits) is O(log N).

count_me_in · January 3, 2018, 12:09am

I was trying to use recursive version of fast exponentiation algorithm but getting TLE on 2nd and 3rd subtask. Can anyone help me regarding same? Please upvote this answer so that I can ask queries

https://www.codechef.com/viewsolution/16740009

eugalt · January 3, 2018, 11:10pm

Superfast - 0s

And it works with arbitrarily large integers!

worldunique · January 9, 2018, 12:49am

@eugalt u really squeezed up !!!