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

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5403	P1364E X-OR bitmasks constructive algorithms divide and conquer interactive probabilities *2700	0 / 0	(None)
	5439	P1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	(None)
	5443	P1372F Omkar and Modes binary search divide and conquer interactive *2700	0 / 0	(None)
	5446	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	(None)
	5457	P1375H Set Merging constructive algorithms divide and conquer *3300	0 / 0	(None)
	5463	P1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	(None)
	5479	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	(None)
	5483	P1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	(None)
	5530	P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	(None)
	5587	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	(None)
	5597	P1423C Dušan's Railway divide and conquer graphs trees *3500	0 / 0	(None)
	5600	P1423H Virus data structures divide and conquer dsu graphs *2500	0 / 0	(None)
	5606	P1425B Blue and Red of Our Faculty! divide and conquer dp *2600	0 / 0	(None)
	5620	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	(None)
	5650	P1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	(None)
	5657	P1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	(None)
	5738	P1470F Strange Covering divide and conquer *3500	0 / 0	(None)
	5775	P1482E Skyline Photo data structures divide and conquer dp *2100	0 / 0	(None)
	5799	P1490D Permutation Transformation dfs and similar divide and conquer implementation *1200	0 / 0	(None)
	5804	P1491E Fib-tree brute force dfs and similar divide and conquer number theory trees *2400	0 / 0	(None)

Pick a problem randomly based on the current filter.