zhoujiarun0216's blog

I Truly Got It！
By zhoujiarun0216, history, 12 months ago, In English

In the recent Div. 4 contest, I only solved two problems. Back then, I set a goal to solve three problems in the next Div. 1+2 contest. Many people mocked me, thinking it was impossible for me to solve three problems, but I did it! I spent about half an hour thinking about problem A and solved it, then another half hour on problem B. Surprisingly, problem D turned out to be so straightforward! I noticed that the XOR value of $$$x$$$ and $$$x+y$$$ remains constant. Based on this insight, I wrote the code and passed D on the first try. I truly succeeded! I hope that in the next Div. 2 contest, I can solve all four problems A, B, C, and D!

Please congratulate me!

Additionally, I hope that Luogu can unblock my account.

  • Vote: I like it
  • -206
  • Vote: I do not like it

»
12 months ago, hide # |
 
Vote: I like it -8 Vote: I do not like it

Bro, you are genius, gratz, I would never come to this statements ever, great approach using XOR, but moreover finding that an operation just make two copies of the x and x+y is brilliant, after one operation x can be only x or x+1(one of those are off, which mean one is on, and this one will strightforward lead us to the gold), and x+y have also two state after one operation (x,y) = > x+y , (x,y+1) => x+y+1 , (x+1,y−1) => x+1+y-1=>x+y and (x+1,y) => x+y+1 where we have x+y+1 and x+y(the same approach can lead us to the gold, just gonna find that one imposter which is off or on). It's hard to expain thoughts not in your native languege, I guess you got the point

→ Reply
  • »
    »
    12 months ago, hide # ^ |
     
    Vote: I like it +8 Vote: I do not like it

    I didn't mean to confirm him as a legit user, but the hint in the blog helped me solve the problem I was struggling with. It's just nice to have different explanations for solving a problem.

    → Reply
»
12 months ago, hide # |
 
Vote: I like it -51 Vote: I do not like it

Amao_Fox chen_zhe

Please unbanned my luogu account! I really solve 3 problems in Div.1+2.

→ Reply
»
12 months ago, hide # |
 
Vote: I like it +22 Vote: I do not like it

https://mirror.codeforces.com/blog/entry/141935#comment-1267519

→ Reply
»
12 months ago, hide # |
 
Vote: I like it +24 Vote: I do not like it

I will watch you in the following Codeforces Round 1019, and if you can't solve A, B, C and D, we're really going to completely mock you.

I am personally more compassionate and have some hope for you. If you can really solve these four problems on your own, I won't criticize you anymore. But if you are still skipped (or you can't solve them), I guess I don't need to waste my words on you.

Please, be wise.

→ Reply
»
12 months ago, hide # |
← Rev. 5  
Vote: I like it +14 Vote: I do not like it

Congratulations to zhoujiarun0216 and zh0ujiarunO216 for using LLM to solve 4 problems in today's competition and became a very strong $$$\color{green}{\texttt{Pupil}}$$$! I believe you have such strength and will definitely become an $$$\color{blue}{\texttt{Expert}}$$$ by solving 5 problems in tomorrow's div.2 using the same method!

→ Reply