guys what i did was in problem b,that sorted the digits of the number if the number was equal to the original one and its last two digits were equal then yes otherwise no.please help me.

i upvoted you lol

please check this bro can you find the bug:no compilation error

https://mirror.codeforces.com/contest/1517/submission/114531396

is this approach correct that we take the xor of whole array if it is zero then yes else if the array contains equal elements and n is odd then yes else no

Thanks bro thanks

ohh i understood it

same here bro

can you explain the case when n<k

can somebody explain why the answer is pow(n,k) i cant understand

can somebody give the proof why is answer not too large in problem perfect number

the same thin is happening with me on CF EDU