constructive algorithms - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4730	P1153B Serval and Toy Bricks constructive algorithms greedy *1200	0 / 0	(None)
	4749	P1157D N Problems During K Days constructive algorithms greedy math *1900	0 / 0	(None)
	4750	P1157F Maximum Balanced Circle constructive algorithms dp greedy two pointers *2000	0 / 0	(None)
	4751	P1157G Inverse of Rows and Columns brute force constructive algorithms *2200	0 / 0	(None)
	4752	P1158A The Party and Sweets binary search constructive algorithms greedy implementation math sortings two pointers *1500	0 / 0	(None)
	4753	P1158C Permutation recovery constructive algorithms data structures dfs and similar graphs greedy math sortings *2100	0 / 0	(None)
	4754	P1158D Winding polygonal line constructive algorithms geometry greedy math *2600	0 / 0	(None)
	4770	P1166E The LCMs Must be Large bitmasks brute force constructive algorithms math number theory *2100	0 / 0	(None)
	4773	P1167D Bicolored RBS constructive algorithms greedy *1500	0 / 0	(None)
	4789	P1174A Ehab Fails to Be Thanos constructive algorithms greedy sortings *1000	0 / 0	(None)
	4791	P1174D Ehab and the Expected XOR Problem bitmasks constructive algorithms *1900	0 / 0	(None)
	4805	P1178D Prime Graph constructive algorithms greedy math number theory *1500	0 / 0	(None)
	4817	P1182D Complete Mirror constructive algorithms dfs and similar dp hashing implementation trees *2400	0 / 0	(None)
	4839	P1186D Vus the Cossack and Numbers constructive algorithms greedy math *1500	0 / 0	(None)
	4842	P1187C Vasya And Array constructive algorithms greedy implementation *1800	0 / 0	(None)
	4857	P1193C Scissors and Tape *special problem constructive algorithms geometry	0 / 0	(None)
	4866	P1196A Three Piles of Candies brute force constructive algorithms math *800	0 / 0	(None)
	4867	P1196B Odd Sum Segments constructive algorithms math *1200	0 / 0	(None)
	4870	P1196E Connected Component on a Chessboard constructive algorithms implementation *1800	0 / 0	(None)
	4871	P1196F K-th Path brute force constructive algorithms shortest paths sortings *2200	0 / 0	(None)

Pick a problem randomly based on the current filter.