Thank you, mate!

So when will be final part of TCO2023? Will it be streaming?

Thank you, mate!

I can not enter with old topcoder arena

Does anyone experience the same problem?

When editorial for this round be released?

yes subsets

Yes, you are right!

Divide array in two arrays for maximum 20 numbers. Then create all combination of sums for two arrays and using Binary search find sum difference in 2nd array

So when is rating going to be updated?

When SRM 806 is going to be? There is SRM 807 in calendar but no SRM 806

Thank you!

What does rating history graph doesn't update in topcoder profile? There is no last 3 SRMS

Where to see final results of contest?

You should change ans from int to long You should change arr[] from int to long

When editorial of SRM795 will be ready?

OK i got it!

Why if one side is equal to zero then it can move at most in one direction Ex: UUUDDDDD There is R and L is equal to zero. 3 U's and 5 D's. So answer must be 3 — UUUDDD But answer is 2. Why?

When editorials will be released?

Is this SRM unrated? It disappeared from Contest Arena

When will be editorials for this round?

OK, thank you I understood using mask

I did it, but it was very long solution. It can be done recursively or iteratively, but I saw solution in 10 rows. I didn't understand that using <<

So, what is best solution for 250 problem?

Damn right!

Explain B problem in Div2

what do faget() and fa do?

More details please. Could you provide a source code?

How to solve Div2 Medium?

I understood that this differentiated formula helps to find the maxima for K=2, what about K=3,4,5?

I don't understand your proof. Could you explain it in a detail way? Where did you get that formula?

Oh, yeah, indeed it is. Thank you for the answer!

Hi guys,

Could someone explain, what is mathematical proof of SRM669 Div2 500's problem's solution, so that it does not matter what numbers you would take in array, the result will be the same?

Thank you!

As I see, the way to solve Div2 1000 is to use Map.
Can someone tell me what is algorithm to solve that problem and how does Map help us?

Thank you

Very enjoyable!

Thank you!

Thank you PlayLikeNeverB4

• 1 0
• 2 1
• 3 0
• 3 1
• 4 2
• 5 0
• 5 2
• 6 1
• 6 2
• 7 0
• 7 1
• 7 2

Let N be equal to 3

Then the result is: 1 0 2 1 3 0 3 1 4 2 5 0 5 2 6 1 6 2 7 0 7 1 7 2

This first column shows mask, the second j. I did not get what these two columns show. As I understood mask shows the number of all subsets of N, so it must be equal to 2^N. That's why in our case it equals to 8, but what does second column show? Is my thinking going in right way?

Thank you

Can you explain this part of solution for Div2 500. Coder was using mask, how does it help us, why do we need mask at all, not just in this solution?

for (int mask = 0; mask < (1 << N); mask++) { list.clear(); for (int j = 0; j < N; j++) { if ((mask & (1 << j)) != 0) { list.add(j); } }

Thank you