### Neumann's blog

By Neumann, history, 7 months ago, ,

I challenge top coders to AC everything in less than 5h.

See you in the ranklist!

• +70

 » 7 months ago, # |   0 do you mean January long challenge? :x
 » 7 months ago, # |   +40 What is Taster? O_O
•  » » 7 months ago, # ^ |   +21 according to google translate: "a person employed to test food or drink (or problems) for quality by tasting it"
•  » » 7 months ago, # ^ |   +38 You get to taste the problemset first, I suppose. Yummy-yum.
•  » » » 7 months ago, # ^ |   0 Enchom And did you find it Yummy-yum?, The problem set. :P
•  » » » » 7 months ago, # ^ |   0 Absolutely
 » 7 months ago, # |   0 How can I register?
•  » » 7 months ago, # ^ |   0 Codechef doesn't require prior registration.
•  » » » 7 months ago, # ^ |   0 thank you
•  » » » 7 months ago, # ^ |   +3 Your pepe profile is very haunting
 » 7 months ago, # |   +15 I challenge top coders to AC everything in less than 5h. (including both challenge problems)
•  » » 7 months ago, # ^ |   +8 To clarify — in the challenge problems, even a 0 score counts as AC, correct? (Since it is relative scoring)
•  » » » 7 months ago, # ^ | ← Rev. 2 →   0 There's an AC verdict and a WA verdict, which is independent of score. It's pretty damn hard to get so few points that they'd be rounded to 0 though.That wouldn't be much of a challenge though.
 » 7 months ago, # |   +4 How to solve ARMYOFME?
•  » » 7 months ago, # ^ |   +10
 » 7 months ago, # |   +3 How to solve ENGLISH?
 » 7 months ago, # |   0 What was the intended complexity for the solution to ENGLISH?I saw solutions of order $O(n * (n + 1) / 2 * maxlen)$ that passed with a few optimizations
•  » » 7 months ago, # ^ |   0 $\mathcal{O}(input)$
•  » » 7 months ago, # ^ | ← Rev. 2 →   0 Yeah, I saw some solutions using trie which I think was intended and is fast enough but some solutions seemed to be using brute force with complexity same as what you wrote. Can anyone explain the solution to this question in detail please?
•  » » » 7 months ago, # ^ | ← Rev. 2 →   0 BRIEF EXPLANATIONYou are given N words and the beauty of a pair of words (w1, w2) is computed as min(length of the common prefix between w1 and w2, length of the common suffix between w1 and w2) ^ 2.Find a way to pair the N words such that the total beauty of all the pairs is maximum and it's ok not to pair a word at all.Hope this helps.
 » 7 months ago, # |   +21 Congrats to the winners!Div 1. cheng2014 tmwilliamlin168 (He moved to the top of the scoreboard in the last day!) white2302 yashChandnani wrong_answer_1 zhouyuyang savinov (highest score in CHEFARMY) Div 2.
 » 7 months ago, # | ← Rev. 2 →   0 Are codechef long challenge div1 problems similar to ICPC problems? Or are the made to be more time consuming?
•  » » 7 months ago, # ^ |   +6 I noticed some legends like ACRush solve everything in ~8h. When we have superhard problems it is solved in 2 or even 4 days.The main difference with ICPC (other than partial scoring) is the tie-break problem, in which contestants spend a lot of time (in some problems the winner wrote more than 2^11 lines of code!).
•  » » » 7 months ago, # ^ |   0 Is there a resource for problems similar to challenge problems? Or any resources to learn how to solve them better?
•  » » » » 7 months ago, # ^ |   0 CodeChef has some editorials. Unfortunately sometimes the editorialist is not well versed in approximate problems and we end up without editorial.Also you can see topcoder marathon matches.