And sometimes hardwork beats lazy talent.

Wow !! Since my mom is not alive now, I'm really glad her ghost is Fucking You (~‾▿‾)~

How did it sound like?

Problem B was quite easy but punished me a lot. I was almost in tears when I finally got an AC before contest ended. I can't stop thanking you guys for the pain and frustration you caused me during the contest. (◍•ᴗ•◍)❤.

Every competitive programmer should know the benefit of competitions as a whole. It makes both parties showcase their best. It's just a matter of choice/preference. Are you against that?

Nice, Entertaining and Interesting to read.<3

https://youtu.be/t5trXhAmWWk Code Anthem by Nirajan (◍•ᴗ•◍)❤.

Orz Orz Orz...

Orz Int-Master heading for -> Grandmaster soon!.

Nice round.I did enjoy the struggle even though I lost rating :).

I mean, everyone in the contest has his level of difficulty to solve but definitely not last 2 problems.

Wish all div2 contest were like this. Quite standard contest.

I also thought so,when I actually saw it during sys tests.

They look like the same but their basically doing different things.While the second code uses var aa which takes temp.first and keeps adding temp.second till the if statement evaluates to true again, the first code uses only the previous values (i.e.: i-1 in temp.first and temp.second).

Thanks for the interesting problems. Overall an awesome contest.Orz. Will make sure I don't miss your future rounds :)

I think today's contest was awesome, Thanks.

Thanks for sharing <3.

We hope so :)

Hoping to change color this time :).

This was a lovely round. Thanks a lot to the problem setters (◍•ᴗ•◍)❤.

Behold The Chinese Round! Orz

Love this round. Hoping to have more lovely rounds like this in the future. (◍•ᴗ•◍)❤

Well I think his efforts and contributions for this community is rather valuable and well appreciated.

Well personally I think the benefit of keeping a friend list is the filter property in contests to know how your doing in it especially when you're messing up :)

AC

Thanks for the lovely contest (◍•ᴗ•◍)❤

This is scary ತ_ʖತ

Hope history doesn't repeat itself ಠ_ಠ Looking forward for interesting but moderate round.

This is horrible :(

Everyone should report the channel now!

(◍•ᴗ•◍)❤

Change your input to Char str[a][b]; and take input as matrix with double loops And check this testcase too should print no 1 2 3 ..RR..

Try this 1 2 2 R..R It's correct but your code says no :)

Sorry for that, I think sieve and modular exponentiation was the only math in it, no single formula.

I think it would've been better outside that loop .

I prefer both, Thanks :)

:)

AC

This is becoming most downvoted editorialಥ‿ಥ Why all those downvotes?

DELTIX AC Quest :)

Code Golf for problem C :)

//BitWiseOperatoR

include <bits/stdc++.h>

using namespace std;

int main(){ ios::sync_with_stdio(NULL); cin.tie(0);

long long sum=0,cnt=0,x,n;
cin>>n;

multiset<long long> tmp;

for(int i=1; i <= n; ++i){
    cin>>x;
    sum+=x;

    if(x<0)tmp.insert(x);

    if(sum<0){     
       auto it = tmp.begin();
       sum+=abs(*it);
       tmp.erase(it);
    }
            else cnt++;

}

cout << cnt;

return 0;

}

Just done up-solving and am so mad at myself for not giving this wonderful contest :)

Where do you guys get such problems? Although punishing, quite simple interesting!

Same here dude, I love Suduku && Snake <3

Longest editorial I ever had the chance to read. Anyways thanks, it's awesome <3

Pls dont look down on gray too. Some Reds were ones grays ಠ_ಠ