Comments
+3

wow lol :/
On PurpleCrayon → Codeforces Round #728, 5 years ago
-34

Can't wait to see the geniosity problems !

purple orz .

0

Great Manipulation !
0

please don't make it unrated please !

:-(
On rishabh-malhotra → Codeforces Diary, 5 years ago
0

I guess there is some error in "Hardest Question Solved" under "Questions stats".

It is rather showing the hardest attempted question.
0

some additional explanation for Q-2 ,

so we have a ^ b ^ c

also note that m is a prime !

from Fermat's little theorem we know a^ m-1 = 1 mod(m) for every prime m

b^c = q*(m-1) + r where q and r are quotients and remainder resp ,

a^(b^c) --> a^(q*(m-1)+r) --> a^q(m-1) * a^r = (1^q) * (a^r) mod(m)

so our ans for a^b^c = a^r(mod m) where b^c = r mod(m-1)
Hope it helps :-)
On I_love_hyumasik_pivasik → Mathforces, 5 years ago
-29

It's a genuine advice...most probably you guys are downvoting bcz I am newbie..but no problem..if "project Euler" seems like a good advice..then solve it gl!
On I_love_hyumasik_pivasik → Mathforces, 5 years ago
-51

Googling the stuff helps most of times.
+3

wow you solved all the Q ...congrats buddy...a well deserved CM![user:PR_0202]