divide and conquer - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2366	P1190D Tokitsukaze and Strange Rectangle data structures divide and conquer sortings two pointers *2000	0 / 0	(None)
	2360	P1192B Dynamic Diameter *special problem data structures dfs and similar divide and conquer trees	0 / 0	(None)
	2231	P1213G Path Queries divide and conquer dsu graphs sortings trees *1800	0 / 0	(None)
	2204	P1217F Forced Online Queries Problem data structures divide and conquer dsu graphs trees *2600	0 / 0	(None)
	2200	P1218D Xor Spanning Tree divide and conquer fft graphs *2400	0 / 0	(None)
	2199	P1218E Product Tuples divide and conquer fft *2500	0 / 0	(None)
	2173	P1223F Stack Exterminable Arrays data structures divide and conquer dp hashing *2600	0 / 0	(None)
	2128	P1237C2 Balanced Removals (Harder) binary search constructive algorithms divide and conquer greedy implementation sortings *1900	0 / 0	(None)
	2062	P1250M SmartGarden constructive algorithms divide and conquer *2500	0 / 0	(None)
	2014	P1257G Divisor Set divide and conquer fft greedy math number theory *2600	0 / 0	(None)
	2007	P1261F Xor-Set bitmasks divide and conquer math *3100	0 / 0	(None)
	1967	P1268D Invertation in Tournament brute force divide and conquer graphs math *3200	0 / 0	(None)
	1921	P1278E Tests for problem D constructive algorithms dfs and similar divide and conquer trees *2200	0 / 0	(None)
	1883	P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	(None)
	1838	P1295E Permutation Separation data structures divide and conquer *2200	0 / 0	(None)
	1791	P1303G Sum of Prefix Sums data structures divide and conquer geometry trees *2700	0 / 0	(None)
	1757	P1311F Moving Points data structures divide and conquer implementation sortings *1900	0 / 0	(None)
	1735	P1316F Battalion Strength data structures divide and conquer probabilities *2800	0 / 0	(None)
	1636	P1336F Journey data structures divide and conquer graphs trees *3500	0 / 0	(None)
	1631	P1338C Perfect Triples bitmasks brute force constructive algorithms divide and conquer math *2200	0 / 0	(None)

Pick a problem randomly based on the current filter.