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

Problemset

33 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
2157G	Isaac's Queries bitmasks brute force constructive algorithms dfs and similar divide and conquer dp greedy interactive math probabilities	2800	672
2138C2	Maple and Tree Beauty (Hard Version) bitmasks brute force dfs and similar dp fft trees	2000	3.6k
2131G	Wafu! bitmasks brute force data structures dfs and similar dp math	2000	3.9k
2086E	Zebra-like Numbers bitmasks brute force constructive algorithms dfs and similar dp greedy math	2400	1.7k
2043E	Matrix Transformation bitmasks brute force data structures dfs and similar graphs greedy implementation	2300	1.9k
1975F	Set bitmasks brute force combinatorics dfs and similar divide and conquer dp math	2600	1.1k
1933G	Turtle Magic: Royal Turtle Shell Pattern bitmasks brute force combinatorics constructive algorithms dfs and similar math	2300	1.2k
1930F	Maximize the Difference bitmasks brute force dfs and similar	2700	979
1929E	Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees	2300	2.1k
1926F	Vlad and Avoiding X bitmasks brute force dfs and similar dp implementation	2200	2.1k
1878G	wxhtzdy ORO Tree binary search bitmasks brute force data structures dfs and similar implementation trees	2300	1.5k
1874B	Jellyfish and Math bitmasks brute force dfs and similar dp graphs shortest paths	2400	1.4k
1804E	Routing bitmasks brute force dfs and similar dp graphs	2400	1.7k
1741G	Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths	2200	2k
1689E	ANDfinity bitmasks brute force constructive algorithms dfs and similar dsu graphs	2500	1.4k
1661B	Getting Zero bitmasks brute force dfs and similar dp graphs greedy shortest paths	1300	21.1k
1659E	AND-MEX Walk bitmasks brute force constructive algorithms dfs and similar dsu graphs	2200	2k
1560F1	Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy	1900	6.8k
1560F2	Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy	2100	5.1k
1552D	Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math	1800	8k
1552G	A Serious Referee bitmasks brute force dfs and similar sortings	3000	687
1543C	Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities	1900	5.7k
1519F	Chests and Keys bitmasks brute force dfs and similar dp flows	3200	797
1508C	Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees	2500	1.8k
1285D	Dr. Evil Underscores bitmasks brute force dfs and similar divide and conquer dp greedy strings trees	1900	8.7k
1038E	Maximum Matching bitmasks brute force dfs and similar dp graphs	2400	1.1k
1036G	Sources and Sinks bitmasks brute force dfs and similar	2700	472
778B	Bitwise Formula bitmasks brute force dfs and similar expression parsing implementation	1800	2.5k
244B	Undoubtedly Lucky Numbers bitmasks brute force dfs and similar	1600	5k
217D	Bitonix' Patrol bitmasks brute force combinatorics dfs and similar math	2900	282
165E	Compatible Numbers bitmasks brute force dfs and similar dp	2200	9.8k
27B	Tournament bitmasks brute force dfs and similar greedy	1300	6k

showing 1–33 of 33