1. 51nod 1091 overlap of segments 2. 51nod 1133 non-overlapping segments 3. 51nod 1163 highest reward (super-classical greedy) 4. 51nod 1255 lexicographically smallest subsequence 5. 51nod 1125 minimal cost of switching machines 6. 51nod 1428 event scheduling issues