Let’s define a Binary Contest: a Codeforces contest whose number consists only of 0s and 1s. Sounds cool, right?

The Binary Contest Timeline So far, 9 Binary Contests have been held: 1, 10, 11, 100, 101, 110, 111, 1000, 1001

And today is the 10th one: 1010!

I've participated in two Binary Contests so far: 1000, 1001

If I keep up this streak, the maximum contest I might participate in is 1111. Why? Because after that, the next Binary Contest will be 10000—which is about 8889 contests later!

That’s practically a lifetime in Codeforces terms! Now the real question is—can I make it to 1111? Or better yet, can I set a legendary record of attending every Binary Contest from now on? Or maybe... if I don’t, my son or grandson can. :)) The Binary Legacy must live on.

I wrote about him before. But I don't know why people started downvoting me. If you check his previous contests, he has zero submissions but a positive delta. Also, in his previous submission, he has submitted the same problem's solution in different languages. Someone told me his rating will be gone in a few days but it's still there and he cheated again in the last Div-4. If you go to his submissions for the last contest, you can clearly see he used AI. It's his CF handle: md.reduanur

UPD: Maybe this cheater's group started downvoting again. No problem, keep going, you cheaters.

UPD 2: This guy gets a compilation error, even though he made his way to expert by cheating. I don't know after how many contests this cheater will be banned.

Here are my two submission for problem : 1158A - The Party and Sweets

1. using accumulate function: 300047140

2. using loop: 300047827

1st one giving wrong answer. Previously, the same thing happened with sqrt, and then I used binary search to find sqrt. So after this WA, I used a loop to get the sum, and now it's giving the correct answer. So where has this accumulate function gone wrong?

I was looking for a solution to a problem. I saw this in a function of that solution:

bool good(ll mid) { ll x = sqrt ( mid ); while( x * x > mid ) x-- ; while( ( x + 1 ) * ( x + 1 ) <= mid ) x++ ; return mid -x >= k; }

how is it possible that: sqrt ( mid ) * sqrt ( mid ) > mid ? or ( sqrt ( mid ) + 1 ) * ( sqrt ( mid ) + 1 ) <= mid ?

all this sqrt has floor value.

That problem link: https://codeforces.me/contest/2020/problem/B

How can I contribute Question in Contests?