constructive algorithms - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1133	P1430C Numbers on Whiteboard constructive algorithms data structures greedy implementation math *1000	0 / 0	(None)
	1116	P1433C Dominant Piranha constructive algorithms greedy *900	0 / 0	(None)
	1115	P1433D Districts Connection constructive algorithms dfs and similar *1200	0 / 0	(None)
	1109	P1436B Prime Square constructive algorithms math *900	0 / 0	(None)
	1104	P1437A Marketing Scheme brute force constructive algorithms greedy math *800	0 / 0	(None)
	1103	P1437B Reverse Binary Strings constructive algorithms greedy *1200	0 / 0	(None)
	1100	P1437E Make It Increasing binary search constructive algorithms data structures dp implementation *2200	0 / 0	(None)
	1097	P1438A Specific Tastes of Andre constructive algorithms implementation *800	0 / 0	(None)
	1096	P1438B Valerii Against Everyone constructive algorithms data structures greedy sortings *1000	0 / 0	(None)
	1095	P1438C Engineer Artem 2-sat chinese remainder theorem constructive algorithms fft flows *2000	0 / 0	(None)
	1094	P1438D Powerful Ksenia bitmasks constructive algorithms math *2200	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)
	1091	P1439A1 Binary Table (Easy Version) constructive algorithms implementation *1500	0 / 0	(None)
	1090	P1439A2 Binary Table (Hard Version) constructive algorithms graphs greedy implementation *1900	0 / 0	(None)
	1089	P1439B Graph Subset Problem constructive algorithms data structures graphs *2600	0 / 0	(None)
	1083	P1442A Extreme Subtraction constructive algorithms dp greedy *1800	0 / 0	(None)
	1079	P1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	(None)
	1077	P1443A Kids Seating constructive algorithms math *800	0 / 0	(None)
	1070	P1444D Rectangular Polyline constructive algorithms dp geometry *2900	0 / 0	(None)
	1066	P1446A Knapsack constructive algorithms greedy sortings *1300	0 / 0	(None)

Pick a problem randomly based on the current filter.