Competitive Programming (CC3032)

	List of Problems
	Pedro Ribeiro - DCC/FCUP

All problems of the course (Mooshak, CodeForces, CSES and UVA), grouped by weekly problem set. Problems marked (extra) are optional suggestions (from the class pages) that are not part of the weekly evaluation.

Weekly Problems #01 - Introduction to the course & first problems

Weekly Problems #02 - Sublinear complexity data structures (map, set, priority_queue)

[Mooshak PC005] - Conformity
[Mooshak PC006] - Playlist
[Mooshak PC007] - Lemming Battle
[Mooshak PC008] - Traffic Lights
[Mooshak PC009] - Sliding Window Cost
[Mooshak PC004] - Cool Sequences (extra)
[Mooshak PC010] - Concert Tickets (extra)
[CodeForces 978A] - Remove Duplicates (extra)
[CodeForces 499B] - Lecture (extra)

Weekly Problems #03 - Sorting, binary search, ternary search, bisection

[Mooshak PC011] - Special Sort
[Mooshak PC012] - Factory Machines
[Mooshak PC013] - Pie
[Mooshak PC014] - Building Construction
[CodeForces 713B] - Searching Rectangles
[CodeForces 818F] - Level Generation (extra)
[CSES 1085] - Array Division (extra)

Weekly Problems #04 - Sqrt decomposition, segment trees and variants

[Mooshak PC015] - The Strongest Warriors
[Mooshak PC016] - Frequent Values
[Mooshak PC017] - Hotel Queries
[Mooshak PC018] - K-Query
[Mooshak PC019] - Light Switching
[Mooshak PC020] - Census (extra)
[CSES 1648] - Dynamic Range Sum Queries (extra)

Weekly Problems #05 - Cumulative sums and fenwick trees (BITs)

[Mooshak PC021] - Maximum Sum
[Mooshak PC022] - Japan
[Mooshak PC023] - Horrible Queries
[Mooshak PC025] - Calculate The Cost
[CodeForces 276C] - Little Girl and Maximum Sum
[Mooshak PC024] - Matrix Summation (extra)
[UVA 10324] - Zeros and Ones (extra)
[UVA 836] - Largest Submatrix (extra)
[UVA 10755] - Garbage Heap (extra)
[UVA 507] - Jill Rides Again (extra)

Weekly Problems #06 - Dynamic Programming I (classic)

[Mooshak PC026] - The Perfect Harmony
[Mooshak PC027] - Mixtures
[Mooshak PC028] - Wavio Sequence
[Mooshak PC029] - String to Palindrome
[Mooshak PC031] - Book Shop II
[Mooshak PC030] - Making Change (extra)
[UVA 497] - Strategic Defense Initiative (extra)
[CSES 1145] - Increasing Subsequence (extra)
[CSES 3403] - Longest Common Subsequence (extra)
[CSES 1639] - Edit Distance (extra)
[CSES 1158] - Book Shop (extra)
[UVA 11137] - Ingenuous Cubrency (extra)
[UVA 348] - Optimal Array Multiplication Sequence (extra)

Pedro Ribeiro - DCC/FCUP | Last update: