Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

Studolymp / IMC / 2001

IMC 2001
contestants 185 · problems 12 (6+6) · scale 0–20 · per-problem yes

Per-problem difficulty

Day 1

Day 2

Difficulty vs discrimination

Each dot is one problem. X — how many solved it (scored ≥ 8 of 10); Y — discrimination, i.e. how well the problem told strong contestants from weak ones (score-vs-total correlation).

A good problem sits high and away from the edges. Bottom-left dots separated nobody — almost everyone failed them the same way.

Problem statistics

Same data as the Day 1 / Day 2 charts above. Add diploma cohorts to compare winners against the field.

cohorts:columns:
#difficultyalldisctopics
avgsolvednear-0
Day 1
P1easy9.088%5%0.23combinatorics
P2medium6.745%10%0.41group theory
P3hard2.820%62%0.43sequences & seriesintegration
P4killer0.32%95%0.32polynomialsnumber theory
P5very hard1.57%74%0.48linear algebra
P6very hard2.610%45%0.44real analysis
Day 2
P7very hard2.312%57%0.23polynomials
P8very hard3.414%24%0.27sequences & series
P9hard2.316%66%0.48geometrycombinatorics
P10very hard1.27%75%0.44linear algebra
P11killer1.43%63%0.30functional equationsreal analysis
P12killer0.54%94%0.13inequalitiesreal analysis

A diploma-cohort cell needs at least 5 scores, else it shows “—”. How these statistics are computed →