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

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

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

When someone takes first place in top contributors list you write blog. So again 'A week with second place in top contributors list'.

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

    Of course that's the only reason Petr writes his blogs. You nailed it

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

      Let's go further. That's why he became a programmer. What an attention seeker.

      And we downvote each other, didn't you know?

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

    So you are commenting to return it to recent actions and to allow to get even more pluses.

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

    The truth has been revealed......

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

Does anyone know how to properly solve problem H? It looks like we screwed this one since we were the only team with >=6 problems which hasn't solved it, but I haven't heard about anyone who solved it faster than O(n3), everybody just "won with tests", solution presented on problem analysis turned out to be O(n3), not as it was intended to and nobody knew how to fix it. Maybe some people were too shy to share their solution during problem analysis or someone not present on Petrozavodsk has solved it? Maybe Egor :)?

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

    I've posted a link to a paper which provides a O(n*n) solution in the topic on the corresponding Opencup contest. Sorry for not linking here — CF textarea and search are still not that friendly to mobile devices, but you should still be able to find it.