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

Автор Petr, 10 лет назад, По-английски
  • Проголосовать: нравится
  • +28
  • Проголосовать: не нравится

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

Some lingustic analysis of Petr's blog can give us adequate rating of CF contests.

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

When I read the title I was afraid that those "tedious" problems refer to Marathon24, but fortunately it doesn't :). And results are still frozen.

"n extremely tedious O(nlogn) data structure problem E that did not require anything more complicated than a stack and binary search, but needed more than an hour to implement and had a lot of possible plus/minus one errors to make." — I can't agree more :p. Though this problem had this nice feature that it was taken from "real life". I'm sure that almost all of us faced that problem during our lifes :D.

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

    What's the reason behind hiding results of Marathon24 for so long when there's a lot of people who are eagering to know whether they advanced or not?