kfqg's blog

By kfqg, history, 6 years ago, In English

For CodeForces round #537 (Div. 2) the problem difficulty algorithm seems incorrect.

Problem B — 694 / 4752 correct submissions during contest, rated 1600

Problem C — 1272 / 2172 correct submissions during contest, rated 1700

Can anyone explain how this could happen? I don't see how any algorithm could rank the C as harder.

  • Vote: I like it
  • +14
  • Vote: I do not like it

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

There's something called weak pretests.

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

    I think that's what he is asking, what is the algorithm