Competitive Programming I – CS211-CP1/2025-Spring

Assignments

• LATE SUBMISSIONS ONLY (Remaining: 24 days 0:01:46)
1. Image Decoding
2. Thanos
3. Join Strings
4. The Rectangles Are Surrounding Us!
5. Baloni
6. Flag Quiz
7. GREAT + SWERC = PORTO
8. Zagrade
9. Postal Delivery
10. Watering Grass
11. Distributing Ballot Boxes
12. Daydreaming Stockbroker
13. Room Painting
14. Batmanacci
15. Ultra-QuickSort
16. Out of Sorts
17. Suspension Bridges
18. Freight Train
19. Wi-Fi
20. Traveling Monk
21. Big Boxes
22. Predicting GME
23. Driving Lanes
24. The Weight Of Words
25. Increasing Subsequence
26. Firefly
27. Paintings
28. The Sound of Silence
29. Counting Subsequences (Hard)
30. Adding Words
31. Square Deal
32. Canvas Painting
33. Horror Film Night
34. Nikola
35. Kayaking Trip
36. Crazy Driver
37. Johnny Applesack
38. Plane Ticket Pricing
39. Balls and Needles
40. Test
41. Dominos
42. Proving Equivalences
43. Presidential Elections
44. Pick up sticks
45. Coast Length
46. Vin Diagrams
47. Through the Grapevine
48. Block Crusher
49. Free Weights
50. The Owl and the Fox
51. Opening Ceremony
52. Transportation Planning
53. Landline Telephone Network
54. Muddy Hike
55. Almost Union-Find
56. Birds on a Wire
57. Multiplication Table
58. Working at the Restaurant
• Topic 0: Introduction and Misc (Ended)
1. Image Decoding
2. Thanos
3. Join Strings
4. The Rectangles Are Surrounding Us!
• Topic 1: Useful Data Structures and Complete Search (Ended)
1. Baloni
2. Flag Quiz
3. GREAT + SWERC = PORTO
4. Zagrade
• Topic 2: Greedy (Ended)
1. Postal Delivery
2. Watering Grass
3. Distributing Ballot Boxes
4. Daydreaming Stockbroker
• Topic 3: Divide and Conquer, Meet in the Middle (Ended)
1. Room Painting
2. Batmanacci
3. Ultra-QuickSort
4. Out of Sorts
• Topic 4: Bisection/BSTA, Meet in the Middle (Ended)
1. Suspension Bridges
2. Freight Train
3. Wi-Fi
4. Traveling Monk
• Topic 5: Intro to Dynamic Programming (Ended)
1. Predicting GME
2. Driving Lanes
3. The Weight Of Words
4. Increasing Subsequence
• Topic 6: DP Applications and 2 Pointer Technique (Ended)
1. Firefly
2. Paintings
3. The Sound of Silence
4. Counting Subsequences (Hard)
• Topic 7: DP2 (Ended)
1. Nikola
2. Kayaking Trip
3. Crazy Driver
4. Johnny Applesack
5. Plane Ticket Pricing
• Topic 8: Graphs 1: Review, DFS/BFS, CC/SCC (Ended)
1. Balls and Needles
2. Test
3. Dominos
4. Proving Equivalences
• Topic 9: Graphs 2: Floodfill and Topological Sort Intro (Ended)
1. Pick up sticks
2. Coast Length
3. Vin Diagrams
4. Through the Grapevine
• Topic 10: Graphs 3: Shortest Paths and CP2 Introduction (Ended)
1. Transportation Planning
2. Landline Telephone Network
3. Muddy Hike
4. Almost Union-Find
• Topic 11: Random Problem Solving (Remaining: 1 day 0:01:46)
1. Driving Range
2. Word Clouds Revisited
3. Class Picture
4. Emptying the Baltic
• Bonus contest! (Remaining: 1 day 0:01:46)

Teachers