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

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2820	P1100F Ivan and Burgers data structures divide and conquer greedy math *2500	0 / 0	(None)
	2758	P1111C Creative Snap binary search brute force divide and conquer math *1700	0 / 0	(None)
	2748	P1114F Please, another Queries on Array? bitmasks data structures divide and conquer math number theory *2400	0 / 0	(None)
	2648	P1139F Dish Shopping data structures divide and conquer *2500	0 / 0	(None)
	2643	P1140E Palindrome-less Arrays combinatorics divide and conquer dp *2200	0 / 0	(None)
	2642	P1140F Extending Set of Points data structures divide and conquer dsu *2600	0 / 0	(None)
	2641	P1140G Double Tree data structures divide and conquer shortest paths trees *2700	0 / 0	(None)
	2606	P1146E Hot is Cold bitmasks data structures divide and conquer implementation *2400	0 / 0	(None)
	2552	P1155D Beautiful Array brute force data structures divide and conquer dp greedy *1900	0 / 0	(None)
	2546	P1156D 0-1-Tree dfs and similar divide and conquer dp dsu trees *2200	0 / 0	(None)
	2545	P1156E Special Segments of Permutation data structures divide and conquer dsu two pointers *2200	0 / 0	(None)
	2501	P1167B Lost Numbers brute force divide and conquer interactive math *1400	0 / 0	(None)
	2465	P1174F Ehab and the Big Finale constructive algorithms divide and conquer graphs implementation interactive trees *2400	0 / 0	(None)
	2460	P1175E Minimal Segment Cover data structures dfs and similar divide and conquer dp greedy implementation trees *2200	0 / 0	(None)
	2459	P1175F The Number of Subpermutations brute force data structures divide and conquer hashing math *2500	0 / 0	(None)
	2458	P1175G Yet Another Partiton Problem data structures divide and conquer dp geometry two pointers *3000	0 / 0	(None)
	2450	P1177B Digits Sequence (Hard Edition) binary search divide and conquer implementation *1800	0 / 0	(None)
	2436	P1179E Alesya and Discrete Math divide and conquer interactive *3200	0 / 0	(None)
	2429	P1181E1 A Story of One Country (Easy) brute force divide and conquer sortings *2500	0 / 0	(None)
	2387	P1186E Vus the Cossack and a Field divide and conquer implementation math *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.