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

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

We are planning to run Yandex.Algorithm finals for online contestants at Sunday, Aug 3 2014 at 19:00. Onsite contestants, please do not discuss Yandex.Algorithm problems at the open boards till the online round end time (20:40 Moscow Time). Problems will be reordered.

Contest entry and link to registration:

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

»
12 лет назад, скрыть # |
 
Проголосовать: нравится +5 Проголосовать: не нравится

Problems will be reordered

Will onsite participants be visible in scoreboard? If yes, does it mean that I can know the order of problems after few onsite contestants submissions?

»
12 лет назад, скрыть # |
 
Проголосовать: нравится -19 Проголосовать: не нравится

In my opinion, 1:40 is a little bit short for the final round. My reasoning is that people that can solve 5 problems in, say, 2:30, are better and should be rated higher than those who can solve 4 in 1:40 and run out of ideas.

That aside, the problems were great, thanks for the contest!

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

    Well, programming competitions are always about speed. Usually, everyone can solve all the problems given sufficiently enough time.

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

      Ha, yeah. Guess there's little place in competitive programming for slowpokes like me. Takes too long to come up with the idea for a hard problem and in short competitions I almost always end up solving one extra problem just 5-10 minutes after the end of the contest.

      • »
        »
        »
        »
        12 лет назад, скрыть # ^ |
        ← Rev. 2  
        Проголосовать: нравится +3 Проголосовать: не нравится

        Then you should have better chances in ACM ICPC or individual contests with longer duration (like GCJ and FHC). I think it is great to have such variety of contests nowadays — everyone can show his strong sides somewhere. Someone like thinking and solving hard problems, working with them for hours or even days, other guys prefer typing:)

»
12 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

How to solve problem Dice without writing a lot of code?

P. S. I like problem "1024 Stack Edition", just easy dynamic programming :)

»
12 лет назад, скрыть # |
← Rev. 2  
Проголосовать: нравится +8 Проголосовать: не нравится

First of all, what is the point of shuffling problems? Because if one will use scoreboard from finals to estimate problem difficulty, he can also get their original names (by just placing cursor on problem letter in scoreboard).

And second question, for all those who know C++ better than me:) What does nice(int x) do in C++? :) I failed problem D because of function with name nice — compare this (WA1) and this (AC) (only difference is in changing function name). I tried first source in CF run, on my PC and everywhere else outside Yandex.Contest — it works well; but on Yandex.Contest there is some nice(int x) in C++ that returns some value >0 for every x in range 1..60000:) And I can't find anything about it in any reference.