Ten Codeforces problems with the longest statements

Revision en1, by ivan100sic, 2018-12-31 05:35:16

Some problems from ICPC-style contests or other online mirrors where texts are not added are missing. The lengths are not exact and are merely good estimates, for example, formulas are counted with three dollar signs at both the beginning and the end. Sample tests and notes (everything below samples) are not counted.

Here's the list:

  1. (4426 bytes) 39G - Inverse Function
  2. (4470 bytes) 1089J - JS Minification
  3. (4591 bytes) 89B - Widget Library
  4. (4619 bytes) 175F - Gnomes of Might and Magic
  5. (4629 bytes) 523B - Mean Requests
  6. (4911 bytes) 642A - Scheduler for Invokers
  7. (5197 bytes) 1070B - Berkomnadzor
  8. (5803 bytes) 1044B - Intersecting Subtrees
  9. (6688 bytes) 921/01 — Labyrinth-1
  10. (10637 bytes) 927A - BuberPool Taxi Optimization

I also have the list of 10 problems with the shortest statements, but all of them are from April's fools contests, I'll publish it when I filter them out. Well, all except this one: 401E - Olympic Games.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English ivan100sic 2018-12-31 05:35:16 980 Initial revision (published)