Petr's blog

By Petr, 10 years ago, In English
  • Vote: I like it
  • +28
  • Vote: I do not like it

»
10 years ago, # |
  Vote: I like it +4 Vote: I do not like it

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

»
10 years ago, # |
  Vote: I like it +11 Vote: I do not like it

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 years ago, # ^ |
    Rev. 2   Vote: I like it 0 Vote: I do not like it

    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?

    • »
      »
      »
      10 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      I don't know, I haven't got any influence on that :P.