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

Problemset

16 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
1849F	XOR Partition binary search bitmasks data structures divide and conquer greedy trees	2700	911
1777F	Comfortably Numb bitmasks data structures divide and conquer strings trees	2400	1.5k
1716E	Swap and Maximum Block bitmasks data structures dfs and similar divide and conquer dp	2500	1.4k
1665E	MinimizOR bitmasks brute force data structures divide and conquer greedy implementation two pointers	2500	1.9k
1654F	Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings	2800	1.5k
1616H	Keep XOR Low bitmasks combinatorics data structures divide and conquer dp math	3000	1.4k
1446C	Xor Tree binary search bitmasks data structures divide and conquer dp trees	2100	4.2k
1416C	XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees	2000	5.2k
1386C	Joker *special bitmasks data structures divide and conquer dsu	2800	698
1146E	Hot is Cold bitmasks data structures divide and conquer implementation	2400	1.1k
1114F	Please, another Queries on Array? bitmasks data structures divide and conquer math number theory	2400	2.6k
1004F	Sonya and Bitwise OR bitmasks data structures divide and conquer	2600	985
981E	Addition on Segments bitmasks data structures divide and conquer dp	2200	2.6k
914E	Palindromes in a Tree bitmasks data structures divide and conquer trees	2400	2k
875D	High Cry binary search bitmasks combinatorics data structures divide and conquer	2200	2.6k

showing 1–16 of 16