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

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1477	P1364E X-OR bitmasks constructive algorithms divide and conquer interactive probabilities *2700	0 / 0	(None)
	1427	P1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	(None)
	1421	P1372F Omkar and Modes binary search divide and conquer interactive *2700	0 / 0	(None)
	1417	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	(None)
	1414	P1373G Pawns data structures divide and conquer greedy *2600	0 / 0	(None)
	1399	P1375H Set Merging constructive algorithms divide and conquer *3300	0 / 0	(None)
	1393	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	(None)
	1391	P1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	(None)
	1363	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	(None)
	1357	P1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	(None)
	1287	P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	(None)
	1250	P1408F Two Different constructive algorithms divide and conquer *2300	0 / 0	(None)
	1219	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	(None)
	1207	P1418G Three Occurrences data structures divide and conquer hashing two pointers *2500	0 / 0	(None)
	1196	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	(None)
	1180	P1423C Dušan's Railway divide and conquer graphs trees *3500	0 / 0	(None)
	1175	P1423H Virus data structures divide and conquer dsu graphs *2500	0 / 0	(None)
	1165	P1425B Blue and Red of Our Faculty! divide and conquer dp *2600	0 / 0	(None)
	1139	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	(None)
	1093	P1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.