Hey there Codeforces!

I was trying to solve the C problem in Codeforces Testing Round #1.

I knew that so many people solved it using binary tree but I wanted to try another aproach. I tried to solve it using SQRT Decomposition. I've got so many wrong answers and altough I've worked on it for like 2 days I couldn't fix the problem. Can you please help me about that?

My code is this.

If you find any bugs or if you have any suggestions I would appreciate it.

Thank you already!

Hello Codeforces,

I've been practicing C++ to improve myself but I kinda stuck with a question. I was hoping you could help.

I met the sqrt(); function and I wonder if I could make it up to 3rd or 4th and even more degrees of root? How can I do that?

Sorry for the bad English btw I am a new learner and I am trying hard to fix my mistakes so if you have any corrections about the usage of language pls inform me.

Thanks already!

In the last contest, which I couldn't take part, two users cheated. .eray and Lutfu submitted almost exactly the same code for problem B. I put the links.

submission of .eray: https://mirror.codeforces.com/contest/1354/submission/80463880

submission of Lutfu: https://mirror.codeforces.com/contest/1354/submission/80509151

This things shouldn't happen.

MikeMirzayanov pls handle it.