Division B 
1 short contest, 2 common contests, 4 thematic contests with lectures 
Division C 
1 short contest, 6 thematic contests with lectures 

Div B:

  • Data structures on trees; 
  • Mobuis inversion formula, Burnside's lemma, SQRT-decomposition; 
  • Suffix automaton and its applications; 
  • Fast long arithmetics.

Div C:

  • Dynamic programming and its applications; 
  • Graph problems: maximum matching, Hall's theorem; 
  • Data structures on segments; 
  • Finding of lowest common ancestor, and problems on tree;
  • Computational geometry;
  • Basics of string algorithms.