MillionDays's blog

Talk about the most interesting problem you solved on codeforces this year
By MillionDays, history, 2 years ago, In English

What do you think? I'd say 1616H - Keep XOR Low.

  • Vote: I like it
  • +24
  • Vote: I do not like it

Comments Comments (5)
| Write comment?
»
2 years ago, # |
  Vote: I like it -37 Vote: I do not like it

shit

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by MillionDays (previous revision, new revision, compare).

→ Reply
»
2 years ago, # |
  Vote: I like it +8 Vote: I do not like it

For me the greatest problems were :

1762D - GCD Queries

1733D2 - Zero-One (Hard Version)

And those problems were nice and I enjoyed solving them although they are a bit easy:

1697D - Guess The String

1772F - Copy of a Copy of a Copy

1713D - Tournament Countdown

→ Reply
»
2 years ago, # |
← Rev. 4   Vote: I like it +3 Vote: I do not like it

I'd like to select a series of problems, you can see them below:

ConstructOR It's so amazing when I first met with it, due to its brief but beautiful statement and interesting methods (such as exgcd I used in the contest).

Carry Bit In my opinion, It's an interesting problem with some typical but natural methods. What strong feelings I've got when I realized to split the whole 01 array into some parts and enumerate them one by one! (though didn't solve during contest /ll)

Factorial Divisibility It's maybe kind of easy for some of you, but to be honest I haven't solved it during the whole contest, I tried some strange approaches, but the brief tutorial astonished me again ---- You just need to scan from small numbers to the large ones, and contribute i to i+1!

It's my pleasure to share some of my attitudes, and I'm happy to write more about the "best problems" what I thought to be if I have enough spare time.

→ Reply
»
2 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Some recent ones, off the top of my head:

Can't solve, but seem cool:

→ Reply