Comments
0

why b is much more harder than c and why the solution with time complexity o(n*log(n)) gets tle? it's just like a bullshit for me!!!
0

The tutorial of problem C really sucks!!!
-10

Don't understand editorial for E, can someone explain it more detailedly?

Thanks a lot in advance.
0

Incredible!!

But it seems more acurate to say there is at most one+or-after*, because*++can be replaced with+*and*--can be replaced with-*. With this statement we know if there exists * in the path, the end of the path is one of *+,*-and*.

If you say "there is at most one+or- between two*, there can be more than one+or-after the last*", it contradicts the above statement.
0

Anyone could help me look at what's the problem of my solution 193477917 for G.

Thanks a lot in advance!
+1

Only got a micro positive delta but luckily became expert from specialist narrowly :)
0

curious about what's genshin
On tourist → Codeforces Round #850, 3 years ago
+18

I got a thousand of WA and I wanna kill myself!!!
0

Has this round been unrated? My rating still keeps unchanged yet!
0

Hey, bro, seems like you know everything about the rules, where did you get it?
0

talent, and nice avatar
+6

I got a delta of +77 in Educational Round 133 with initial rating of 1333 and rank of 3959.

But I only get a delda of +36 this time with initial rating of 1392 and rank of 2185.

I thought I might get a delta over +100, it's far from my expection :(, and I'm confused.
0

It seems that we should check every number in array c, if there exists one i, every bit in c[i] appears 2 times in the whole input, then the answer is "YES", otherwise "NO".
+6

Just curious what's the meaning to reply this message recursively
0

Best ever standing and solved problem C in Div. 2 the first time! But I didn't have any clue of problem B :(
0

Awesome! Now I got it, thanks a lot.
0

condition: "If you have 2^i in the initial array, then applying the operation gives you 2^i⊕x which must be in the final array." result: "Therefore, 2^i⊕x is also valid." I can't understand the reasoning, why we can get the result from the condition, could you please explain it more detailedly?
0

Have you known the answer now, I have the same question.
0

Never thought that i can learn this kind of things on cf!!!
0

Excuse me, but I'm just curious about the meaning of "XD".
On glebustim → Codeforces Round #814, 4 years ago
-8

居然还能打中文
On glebustim → Codeforces Round #814, 4 years ago
0

me either, i just wanna know why it doesn't work and how to solve this problem.
0

awesome !!!