Problem Difficulty Algorithm Seems Broken

Revision en2, by kfqg, 2019-02-07 23:56:38

For CodeForces round #537 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 why the C is rated as harder than the B for this one? I don't see how any algorithm could rank the C as harder in this contest.

http://codeforces.net/contest/1111/standings

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en6 English kfqg 2019-02-08 00:22:25 63
en5 English kfqg 2019-02-08 00:20:54 0 (published)
en4 English kfqg 2019-02-07 23:57:54 9 Tiny change: 'round #537](http://c' -> 'round #537 (Div. 2)](http://c'
en3 English kfqg 2019-02-07 23:57:19 94
en2 English kfqg 2019-02-07 23:56:38 16 (saved to drafts)
en1 English kfqg 2019-02-07 23:41:26 474 Initial revision (published)