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

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	7695	P1680F Lenient Vertex Cover dfs and similar divide and conquer dsu graphs trees *2600	0 / 0	(None)
	7689	P1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	(None)
	7675	P1684H Hard Cut constructive algorithms dfs and similar divide and conquer math *3400	0 / 0	(None)
	7642	P1691D Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers *1800	0 / 0	(None)
	7750	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	(None)
	7736	P1696D Permutation Graph binary search constructive algorithms data structures divide and conquer greedy shortest paths	0 / 0	(None)
	7872	P1715E Long Way Home data structures divide and conquer dp geometry graphs greedy shortest paths	0 / 0	(None)
	7808	P1716E Swap and Maximum Block bitmasks data structures dfs and similar divide and conquer dp *2500	0 / 0	(None)
	7879	P1721D Maximum AND bitmasks divide and conquer greedy sortings	0 / 0	(None)
	7937	P1734F Zeros and Ones bitmasks divide and conquer dp math	0 / 0	(None)
	8037	P1740I Arranging Crystal Balls data structures divide and conquer divide and conquer dp geometry graphs number theory *3500	0 / 0	10
	7986	P1741D Masha and a Beautiful Tree dfs and similar divide and conquer graphs sortings trees	0 / 0	(None)
	8060	P1748E Yet Another Array Counting Problem data structures divide and conquer dp flows math trees *2300	0 / 0	8
	8049	P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings	0 / 0	(None)
	8150	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	8130	P1770G Koxia and Bracket divide and conquer fft math	0 / 0	(None)
	8121	P1773B BinCoin binary search divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	8174	P1777F Comfortably Numb binary search bitmasks data structures divide and conquer dsu strings trees two pointers	0 / 0	(None)
	8098	P1783G Weighed Tree Radius data structures divide and conquer implementation trees	0 / 0	(None)
	8202	P1787I Treasure Hunt data structures divide and conquer two pointers *3400	0 / 0	10

Pick a problem randomly based on the current filter.