constructive algorithms - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	361	P1578M The Mind constructive algorithms interactive probabilities *2700	0 / 0	(None)
	357	P1579D Productive Meeting constructive algorithms graphs greedy *1400	0 / 0	(None)
	356	P1579E1 Permutation Minimization by Deque constructive algorithms greedy math *1000	0 / 0	(None)
	348	P1580E Railway Construction brute force constructive algorithms data structures graphs shortest paths *3400	0 / 0	(None)
	345	P1581B Diameter of Graph constructive algorithms graphs greedy math *1200	0 / 0	(None)
	341	P1582D Vupsen, Pupsen and 0 constructive algorithms math *1600	0 / 0	(None)
	335	P1583B Omkar and Heavenly Tree constructive algorithms trees *1200	0 / 0	(None)
	333	P1583D Omkar and the Meaning of Life constructive algorithms greedy interactive *1800	0 / 0	(None)
	332	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	(None)
	331	P1583F Defender of Childhood Dreams bitmasks constructive algorithms divide and conquer *2500	0 / 0	(None)
	314	P1586I Omkar and Mosaic combinatorics constructive algorithms math *3500	0 / 0	(None)
	311	P1592B Hemose Shopping constructive algorithms dsu math sortings *1200	0 / 0	(None)
	310	P1592C Bakry and Partitioning bitmasks constructive algorithms dfs and similar dp graphs trees *1700	0 / 0	(None)
	307	P1592F1 Alice and Recoloring 1 constructive algorithms greedy *2600	0 / 0	(None)
	306	P1592F2 Alice and Recoloring 2 constructive algorithms flows graph matchings greedy *2800	0 / 0	(None)
	298	P1593G Changing Brackets constructive algorithms data structures dp greedy *2200	0 / 0	(None)
	294	P1594D The Number of Imposters constructive algorithms dfs and similar dp dsu graphs *1700	0 / 0	(None)
	291	P1594F Ideal Farm constructive algorithms math *2400	0 / 0	(None)
	283	P1599A Weights constructive algorithms greedy two pointers *2600	0 / 0	(None)
	263	P1602B Divine Array constructive algorithms implementation *1100	0 / 0	(None)

Pick a problem randomly based on the current filter.