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

Problemset

365 problems · filtered by 1 tag

#	Name	Rating↕	Solved↕
2249E1	String (Easy Version) divide and conquer implementation strings	unrated	103
2249E2	String (Hard Version) divide and conquer implementation strings	unrated	70
2245G	NPC Challenge divide and conquer interactive	unrated	101
2239E	The end of this world, data structures divide and conquer dsu graphs	3300	154
2236G	Criterion in Burlandia binary search bitmasks brute force data structures dfs and similar divide and conquer implementation trees two pointers	2600	385
2234D	XOR, Expression and Two Binary Numbers bitmasks divide and conquer dp math number theory	1500	8.6k
2234E	Vlad, Misha and Two Arrays brute force combinatorics dfs and similar divide and conquer math	2100	1.9k
2230F	Game on Growing Tree binary search dfs and similar divide and conquer dp games implementation trees	2700	510
2228F	Momoyo and the Network binary search dfs and similar divide and conquer dp trees	2700	337
2223E	Zhily and Permutation data structures divide and conquer trees	3500	56
2223F	Zhily and Colorful Strings divide and conquer fft math	3400	107
2222F	Building Tree data structures divide and conquer dsu graphs implementation	2600	716
2222G	Statistics on Tree binary search brute force dfs and similar divide and conquer graphs trees	3100	215
2219B1	Unique Values (Easy version) binary search constructive algorithms divide and conquer interactive math	1900	4.2k
2211F	Learning Binary Search combinatorics divide and conquer dp math	2400	1k
2207C	Where's My Water? data structures divide and conquer dp math	1600	6.4k
2207H1	Bowser's Castle (Easy Version) binary search constructive algorithms divide and conquer greedy interactive trees	unrated	60
2207H2	Bowser's Castle (Medium Version) constructive algorithms divide and conquer interactive trees two pointers	unrated	51
2207H3	Bowser's Castle (Hard Version) constructive algorithms divide and conquer interactive trees two pointers	unrated	69
2205D	Simons and Beating Peaks data structures divide and conquer dp greedy implementation trees	1700	5.6k
2203F	Binary Search with One Swap binary search divide and conquer dp hashing math two pointers	2600	457
2200H	Six Seven divide and conquer math number theory strings trees	2600	528
2187F1	Al Fine (Maximizing Version) binary search data structures divide and conquer trees	3100	256
2185F	BattleCows data structures divide and conquer implementation	1700	5.5k
2180E	No Effect XOR bitmasks divide and conquer dp greedy math	2300	1.8k
2178E	Flatten or Concatenate binary search divide and conquer interactive	2000	3.8k
2173F	Isla's Memory Thresholds binary search brute force data structures divide and conquer math	2600	623
2172J	Sliding Tiles data structures divide and conquer dsu	2300	606
2169D2	Removal of a Sequence (Hard Version) binary search divide and conquer greedy implementation math number theory	2100	2.4k
2163D1	Diadrash (Easy Version) binary search brute force divide and conquer implementation interactive	2100	2.8k
2158E	Sink data structures divide and conquer dsu graphs implementation	2600	665
2157F	Git Gud brute force constructive algorithms divide and conquer math ternary search	2400	1.5k
2157G	Isaac's Queries bitmasks brute force constructive algorithms dfs and similar divide and conquer dp greedy interactive math probabilities	2800	672
2154E	No Mind To Think binary search divide and conquer greedy sortings ternary search two pointers	2500	1.2k
2150E1	Hidden Single (Version 1) divide and conquer interactive math probabilities sortings	2600	2.1k
2150E2	Hidden Single (Version 2) binary search divide and conquer interactive math probabilities	2800	669
2149G	Buratsuta 3 binary search brute force data structures divide and conquer probabilities	2100	2.8k
2146D1	Max Sum OR (Easy Version) bitmasks constructive algorithms divide and conquer greedy trees	1500	11.2k
2146D2	Max Sum OR (Hard Version) bitmasks constructive algorithms divide and conquer greedy	2000	4.3k
2146E	Yet Another MEX Problem brute force constructive algorithms data structures divide and conquer greedy hashing	2300	2.2k
2145F	Long Journey dfs and similar divide and conquer dp graphs greedy math matrices number theory	2500	1.1k
2145G	Cost of Coloring combinatorics divide and conquer dp fft math	2900	642
2126G2	Big Wins! (hard version) binary search data structures divide and conquer dsu trees two pointers	2400	1.2k
2125F	Timofey and Docker binary search divide and conquer dp	3000	448
2122D	Traffic Lights brute force data structures divide and conquer dp graphs greedy shortest paths	2400	2.8k
2122F	Colorful Polygon constructive algorithms divide and conquer geometry	3400	151
2121G	Gangsta data structures divide and conquer math sortings	1900	5.5k
2117H	Incessant Rain data structures divide and conquer sortings	2500	1k
2106G1	Baudelaire (easy version) binary search constructive algorithms divide and conquer greedy interactive trees	2200	1.7k
2106G2	Baudelaire (hard version) binary search dfs and similar divide and conquer implementation interactive trees	2500	647
2104G	Modulo 3 data structures divide and conquer dsu graphs trees	2700	553
2101B	Quartet Swapping brute force data structures divide and conquer greedy sortings	1800	8.1k
2077E	Another Folding Strip combinatorics constructive algorithms data structures divide and conquer dp greedy math	2700	627
2074F	Counting Necessary Nodes bitmasks divide and conquer greedy implementation math	2000	2.5k
2072G	I've Been Flipping Numbers for 300 Years and Calculated the Sum binary search brute force combinatorics divide and conquer math number theory	2200	2.2k
2070E	Game with Binary String constructive algorithms data structures divide and conquer games greedy math	2200	1.9k
2070F	Friends and Pizza bitmasks divide and conquer dp fft	3000	379
2069F	Graph Inclusion data structures dfs and similar divide and conquer dsu graphs	2800	824
2065H	Bro Thinks He's Him combinatorics data structures divide and conquer dp math matrices	2200	2k
2061I	Kevin and Nivek divide and conquer dp	3500	133
2056D	Unique Median binary search brute force combinatorics data structures divide and conquer dp	2200	3.7k
2053C	Bewitching Stargazer bitmasks divide and conquer dp math	1500	12.6k
2050F	Maximum modulo equality data structures divide and conquer math number theory	1700	11.3k
2048F	Kevin and Math Class brute force data structures divide and conquer dp implementation math trees	2500	1.3k
2042E	Vertex Pairs binary search brute force data structures dfs and similar divide and conquer greedy implementation trees	2900	535
2041J	Bottle Arrangement data structures divide and conquer dp dsu greedy	2700	273
2036G	Library of Magic binary search constructive algorithms divide and conquer interactive math number theory	2200	1.7k
2035D	Yet Another Real Number Problem binary search data structures divide and conquer greedy implementation math	1800	5.9k
2035G2	Go Learn! (Hard Version) divide and conquer dp	3500	114
2026F	Bermart Ice Cream data structures dfs and similar divide and conquer dp implementation trees	2700	413
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
2014H	Robin Hood Archery data structures divide and conquer greedy hashing	1900	6k
2011I	Stack and Queue *special data structures divide and conquer	unrated	24
2006C	Eri and Expanded Sets data structures divide and conquer math number theory two pointers	2300	2.1k
2005D	Alter the GCD binary search brute force data structures divide and conquer implementation number theory	2400	1.3k
2003E1	Turtle and Inversions (Easy Version) brute force divide and conquer dp greedy math	2600	902
2003E2	Turtle and Inversions (Hard Version) brute force data structures divide and conquer dp greedy math two pointers	2700	654
2001C	Guess The Tree binary search brute force dfs and similar divide and conquer dsu greedy interactive trees	1500	13.1k
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
1990F	Polygonal Segments brute force data structures divide and conquer dp greedy two pointers	2800	464
1989F	Simultaneous Coloring dfs and similar divide and conquer graphs	3000	620
1988E	Range Minimum Sum binary search brute force data structures divide and conquer implementation	2300	1.9k
1987G1	Spinning Round (Easy Version) divide and conquer dp trees	2900	361
1987G2	Spinning Round (Hard Version) divide and conquer dp trees	3500	255
1983D	Swap Dilemma constructive algorithms data structures divide and conquer greedy math sortings	1700	11.5k
1982E	Number of k-good subarrays bitmasks brute force combinatorics divide and conquer dp math meet-in-the-middle	2300	1.9k
1976D	Invertible Bracket Sequences binary search combinatorics data structures divide and conquer implementation two pointers	2000	5.9k
1975F	Set bitmasks brute force combinatorics dfs and similar divide and conquer dp math	2600	1.1k
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
1956D	Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math	2000	4.9k
1951E	No Palindromes brute force constructive algorithms divide and conquer greedy hashing implementation math strings	2000	4.6k
1940C	Burenka and Pether *special data structures dfs and similar divide and conquer dsu graphs sortings trees	unrated	44
1936E	Yet Yet Another Permutation Problem divide and conquer fft math	3400	155
1930D2	Sum over all Substrings (Hard Version) bitmasks divide and conquer dp dsu greedy implementation strings	2100	3.1k
1922E	Increasing Subsequences bitmasks constructive algorithms divide and conquer greedy math	1800	9.3k

showing 1–100 of 365