Comments
+3

Ahh, thanks a bunch dude. You're the best :)
0

Can you help me debug my solution. 300958196 My approach seems to be the same as the editorial but I seem to get WA on test 38. Seems to be some edge case
0

Can you explain E?
+2

Lmao
0

Can anyone explain E?
+1

I am not able to add my handle on the theme cp website. Is anyone else facing this issue?
0

Can anyone explain the time complexity in problem C Cubes? I am not able to understand the last simplification there
+10

Congrats
0

Can you please explain how you got to this solution? Did you brute force for small values and try to find the sequence?
+9

Can someone explain E? I see a lot of people posting about OEIS but I have never heard of this before. Can anyone explain?
0

Thanks for your response electron. I think I intuitively understand how we get the shift factor of 2 ^ k — 1 now when you mentioned it.
0

Can you please share some sources with a more detailed explanation on how applying a permutation works how you have described?
0

This is only required in E2. For E1, a solution with O(n * m * l) should pass
0

I've updated the testcase correctly. Can you look and tell me now why Narek wins?
0

I think this is the intended complexity for E1
0

Nvm, I read the test case wrong.

0

Oh, I seem to have misunderstood the problem. I thought that they can only choose elements from the array A. Since the array A has only the element 6, how can Tsovak pick (1, 1) or (2, 1)?
0

For problem E1, can someone help me understand why Narek wins in this testcase : 

6 6 6
1 2 3 4 5 6
1 2 7 7 7 7
7 2 7 7 7 7
7 7 3 7 7 7
7 7 7 4 7 7
7 7 7 7 5 7
7 7 7 7 7 6

This is my submission which is failing for this test : [submission:https://mirror.codeforces.com/contest/2005/submission/281255124]
0

How about blank? Inspired by no game no life
On Daf-get34 → Inqueue, 20 months ago
0

Ahh, I meant morning in India time which is approximately 5 hours ago. Thanks for the information though
On Daf-get34 → Inqueue, 20 months ago
0

It's been down since morning right? I don't want to break my streak of submitting daily
On pikamonstruosa → Good luck, tourist!, 21 month(s) ago
0

Guys, this was a joke. Relax xD
On pikamonstruosa → Good luck, tourist!, 21 month(s) ago
-17

Petition for all other LGMs to throw so tourist can get to 4000
0

In the question Arena of Greed, let us say that we have 4k coins. If we pick 2k coins, what is the guarantee that the opponent will pick k coins? Since the opponent also plays optimally, is it guaranteed that from 2k coins, his optimal strategy is to pick k coins? Can someone explain this?