- Cut Length Geomtry Problem F
- Edge Coloring in Bipartite Graph Problem F
- Minimum spanning tree for each edge
- Frogs and mosquitoes
- Expensive Strings
- Sorted and Sorted
- Complete Compress
- Xor Shift -- (String Algorithm , Check CPC for the other explaination)
- Xors on Segments
- The Sum of the k-th Powers
- Thief in a Shop ---- ( FFT )
- Magic Matrix
- Ants on a Circle
- Four Divisors
- Lena and Queries
- T-Shirts — ( Data Structures)
- Two Arithmetic Progressions ---- ( Number Thory Algorithms)
- String Set Queries ---- (Aho-Corasik algorithm )
- Tree nesting -- (DP , bitmask , center of Tree)
- Periodic RMQ Problem ---- (Advanced Compression Seg Tree)
- Card Game ----- (Flows)
- Anthem of Berland ----- (Prefix Function , KMP Algorithm)
- Mages and Monsters
- Bear and Bowling 4
- Counting on a Tree --(Hard Seg Tree)
- Easy Queries --(Hard Seg Tree)