Competitive Programming 2 – CS311-CP2/2021-Fall

Assignments

• Topic 0: Introduction (Ended)
1. Getting Gold
2. Pivot
3. Horror List
4. Bird Rescue
• Topic 1: Recursive Search (Ended)
1. Fruit Baskets
2. Paintings
3. Dobra
• Topic 2: Simulation and Bisection (Ended)
1. Financial Planning
2. Free Weights
3. Memory Match
• Topic 3: Dynamic Programming I (Ended)
1. Keyboards in Concert
2. Narrow Art Gallery
3. Train Sorting
• Topic 4: Linked List and Queues (Ended)
1. Ferry Loading III
2. Join Strings
3. Knigs of the Forest
• Topic 5: Stacks (Ended)
1. Even Up Solitaire
2. Working at the Restaurant
3. Teque
• Topic 6: Tree (Ended)
1. Marbles On A Tree
2. Molekule
3. Numbers On a Tree
• Topic 7: Dynamic Programming II (Ended)
1. Exact Change
2. Knapsack
3. Nine Packs
• Topic 8: Traversal and Topological Sort (Ended)
1. Brexit
2. Build Dependencies
3. Pick up sticks
• Topic 9: Union Find and MST (Ended)
1. Ladice
2. Lost Map
3. Millionaire Madness
• Topic 10: Shortest Paths (Ended)
1. All Pairs Shortest Path
2. Flowery Trails
3. Nikola

Teachers