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

Problemset

14 problems · filtered by 3 tags

#	Name	Rating↕	Solved↕
2207H1	Bowser's Castle (Easy Version) binary search constructive algorithms divide and conquer greedy interactive trees	unrated	60
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
2001C	Guess The Tree binary search brute force dfs and similar divide and conquer dsu greedy interactive trees	1500	13.1k
1990E1	Catch the Mole(Easy Version) binary search data structures dfs and similar interactive trees	2500	1.2k
1990E2	Catch the Mole(Hard Version) binary search data structures dfs and similar divide and conquer interactive trees	2600	1.2k
1854D	Michael and Hotel binary search interactive trees	3000	695
1592D	Hemose in ICPC ? binary search dfs and similar implementation interactive math number theory trees	2300	2.7k
1535E	Gold Transfer binary search data structures dp greedy interactive trees	2200	3.1k
1370F1	The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees	2400	1.8k
1370F2	The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees	2700	1.7k
1158E	Strange device binary search interactive math trees	3400	232
1129E	Legendary Tree binary search interactive trees	3100	634
772E	Verifying Kingdom binary search divide and conquer interactive trees	3200	224

showing 1–14 of 14