Блог пользователя kingofnumbers

Автор kingofnumbers, 8 лет назад, По-английски

Hello!

I invite you to participate in the next code monk contest which will be about topic "Dynamic Programming II", if you are interested in learning new techniques of dynamic programming, then this is the right contest for you, the contest will have four problems related to dynamic programming, each one is solved by different dp technique, and the contest length is 3 hours and will start tomorrow Wednesday 11 Nov 2015, 03:30 PM UTC here's the link of contest.

I am(kingofnumbers) the problem setter, I_love_Tanya_Romanova is the tester of the contest, and editorials for the problems will be provided to you by Sokolov.

we hope you enjoy the contest and benefit from it.

looking forward to see you at the contest, good luck.

  • Проголосовать: нравится
  • +42
  • Проголосовать: не нравится

»
8 лет назад, # |
  Проголосовать: нравится +1 Проголосовать: не нравится

Website is incredibly slow :'( I don't manage to get the statement of the last problem...

Also, I have a strange problem of TL, maybe it's just me. (but 2nd in the rating for the moment, yay :D)

»
8 лет назад, # |
  Проголосовать: нравится +13 Проголосовать: не нравится

Check out my 100-point submission on the last task: http://ideone.com/XcGdqz :D
I used the percentage of matching which is given for each test to guess all answers. Then I hash the input and for each hash I give the corresponding answer. That needed, I think 100+(maybe 200+) submissions :D :D :D

  • »
    »
    8 лет назад, # ^ |
      Проголосовать: нравится +5 Проголосовать: не нравится

    I've been watching you doing that during the contest :) it's nice indeed, but it doesn't serve the aim of the contest which is practicing, and you didn't get the prizes :)

    • »
      »
      »
      8 лет назад, # ^ |
        Проголосовать: нравится 0 Проголосовать: не нравится

      Well, I was in top 3 of Code Monk twice and they told me that I am not considered to be a beginner so I wouldn't get prize in any way :D But yeah, it's a really nice problem, I will spend some time thinking on it :)