解説

コンテスト全体の解説


A - I Love MST Problem


B - Cumulative Sum Minimization


C - Addictive Addition


D - Can I Press Them All?


E - Reversed Number Sum


F - (1,2,...,N) の順列のうち長さ 3 の単調減少な連続部分列を含まないものの個数 mod 10^9+9 を知りたい


G - Treasure Collection


H - Takosan Takusan


I - Odd Even Partition


J - Moving Pieces on Namori


K - Loaded Dice


L - Many Max Streak Problems


M - Popcount MST


N - Times Table Sum


O - Three Constraints


P - Making Arithmetic Progression


Q - Colorful Wristbands


R - Many Strings