Competitive Programming 2 – CS311-CP2/Summer2020

Assignments

• T01: Recursive Search (Ended)
1. Dobra
2. Fruit Baskets
3. Good Morning!
• T02: Simulation and Bisection (Ended)
1. Ants
2. Financial Planning
3. Traveling Monk
• T03: Dynamic Programming I (Ended)
1. Radio Commercials
2. Keyboards in Concert
3. Train Sorting
• T04: Linked List and Queues (Ended)
1. Ferry Loading III
2. Join Strings
3. Knigs of the Forest
• T05: Stacks (Ended)
1. Even Up Solitaire
2. Working at the Restaurant
3. Teque
• T06: Tree (Ended)
1. Marbles On A Tree
2. Molekule
3. Numbers On a Tree
• T08: Traversal and Topological Sort (Ended)
1. Brexit
2. Build Dependencies
3. Pick up sticks
• T09: Union Find and MST (Ended)
1. Ladice
2. Lost Map
3. Millionaire Madness
• T07: Dynamic Programming II (Ended)
1. Exact Change
2. Knapsack
3. Nine Packs
• T10: Shortest Paths (Ended)
1. All Pairs Shortest Path
2. Flowery Trails
3. Nikola

Teachers