Competitive Programming 2 – CS311-CP2/2022-Spring

Assignments

• Topic 0: Intro and review of data structures (Ended)
1. Getting Gold
2. Horror List
3. Pivot
4. Bird Rescue
• Topic 1: Trees (Ended)
1. Appeal to the Audience
2. Decisions, Decisions
3. Tourists
• Topic 2: Shortest Paths (Ended)
1. All Pairs Shortest Path
2. Flowery Trails
3. Fire
• Topic 3: Dynamic Programming 1 (Ended)
1. Keyboards in Concert
2. Narrow Art Gallery
3. Train Sorting
• Topic 4: DAGs (Ended)
1. Brexit
2. Pick up sticks
3. Mountain Scenes
• Topic 5: MST and Union Find (Ended)
1. Lost Map
2. Forests
3. Arctic Network
• Topic 6: Backtracking and Simulation (Ended)
1. Fruit Baskets
2. Mini Battleship
3. Paintings
• Topic 7: DP2 (Ended)
1. A Favourable Ending
2. Pebble Solitaire
3. Nine Packs
• Topic 8: Mathematics: Number Theory (Ended)
1. Prime Reduction
2. Smallest Multiple
3. How Many Digits?
• Topic 9: String Processing: DP, matching (Ended)
1. ls
2. In Flagrante Delicto
3. Boggle
• Topic 10: Range Queries (Ended)
1. Fenwick Tree
2. Just for Sidekicks
3. Supercomputer
• Bonus Contest (Fixed) (Ended)
1. Kitten on a Tree
2. Pachinko Probability
3. Let's Play Monopoly!
4. Communications Satellite
5. Goldbach's Conjecture
6. String Factoring
7. Movie Collection

Teachers