11,311/11,320 captured·📄 81 PDFs⊘ 0 skipped9 remaining100%

Problemset

42 problems · filtered by 3 tags

#	Name	Rating↕	Solved↕
2236G	Criterion in Burlandia binary search bitmasks brute force data structures dfs and similar divide and conquer implementation trees two pointers	2600	385
2187F1	Al Fine (Maximizing Version) binary search data structures divide and conquer trees	3100	256
2173F	Isla's Memory Thresholds binary search brute force data structures divide and conquer math	2600	623
2149G	Buratsuta 3 binary search brute force data structures divide and conquer probabilities	2100	2.8k
2126G2	Big Wins! (hard version) binary search data structures divide and conquer dsu trees two pointers	2400	1.2k
2056D	Unique Median binary search brute force combinatorics data structures divide and conquer dp	2200	3.7k
2042E	Vertex Pairs binary search brute force data structures dfs and similar divide and conquer greedy implementation trees	2900	535
2035D	Yet Another Real Number Problem binary search data structures divide and conquer greedy implementation math	1800	5.9k
2018E1	Complex Segments (Easy Version) binary search data structures divide and conquer dsu greedy math sortings	3300	246
2018E2	Complex Segments (Hard Version) binary search data structures divide and conquer dsu greedy math sortings	3400	210
2005D	Alter the GCD binary search brute force data structures divide and conquer implementation number theory	2400	1.3k
1998E1	Eliminating Balls With Merging (Easy Version) binary search brute force data structures divide and conquer greedy	2200	2.3k
1998E2	Eliminating Balls With Merging (Hard Version) binary search brute force data structures divide and conquer greedy implementation	2500	927
1997E	Level Up binary search brute force data structures divide and conquer implementation	2200	3.9k
1990E2	Catch the Mole(Hard Version) binary search data structures dfs and similar divide and conquer interactive trees	2600	1.2k
1988E	Range Minimum Sum binary search brute force data structures divide and conquer implementation	2300	1.9k
1976D	Invertible Bracket Sequences binary search combinatorics data structures divide and conquer implementation two pointers	2000	5.9k
1969E	Unique Array binary search data structures divide and conquer dp greedy	2400	1.9k
1957F1	Frequency Mismatch (Easy Version) binary search data structures divide and conquer hashing probabilities trees	2600	706
1896D	Ones and Twos binary search data structures divide and conquer math two pointers	1700	7.1k
1887D	Split binary search data structures divide and conquer dsu math trees two pointers	2700	1.3k
1849E	Max to the Right of Min binary search data structures divide and conquer dp dsu two pointers	2300	2.3k
1849F	XOR Partition binary search bitmasks data structures divide and conquer greedy trees	2700	911
1766E	Decomposition binary search brute force data structures divide and conquer dp two pointers	2300	1.5k
1750E	Bracket Cost binary search data structures divide and conquer dp greedy strings	2400	1.7k
1748E	Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees	2300	2.8k
1706E	Qpwoeirut and Vertices binary search data structures dfs and similar divide and conquer dsu greedy trees	2300	4k
1696D	Permutation Graph binary search constructive algorithms data structures divide and conquer greedy shortest paths	1900	6.1k
1691D	Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers	1800	7.7k
1615H	Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths	3000	457
1550F	Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths	2700	958
1548B	Integers Have Friends binary search data structures divide and conquer math number theory two pointers	1800	11.6k
1547F	Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers	1900	7.2k
1527E	Partition Game binary search data structures divide and conquer dp	2500	3.1k
1461D	Divide and Summarize binary search brute force data structures divide and conquer implementation sortings	1600	10.4k
1446C	Xor Tree binary search bitmasks data structures divide and conquer dp trees	2100	4.2k
1439C	Greedy Shopping binary search data structures divide and conquer greedy implementation	2600	2.3k
1428F	Fruit Sequences binary search data structures divide and conquer dp two pointers	2400	2.6k
875D	High Cry binary search bitmasks combinatorics data structures divide and conquer	2200	2.6k
833B	The Bakery binary search data structures divide and conquer dp two pointers	2200	6.8k
660F	Bear and Bowling 4 binary search data structures divide and conquer geometry ternary search	2500	2.5k
150E	Freezing with Style binary search data structures divide and conquer trees	3000	1.1k

showing 1–42 of 42