Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5474	P1383F Special Edges flows graphs *3200	0 / 0	(None)
	5475	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	(None)
	5476	P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	(None)
	5477	P1385A Three Pairwise Maximums math *800	0 / 0	(None)
	5478	P1385C Make It Good greedy *1200	0 / 0	(None)
	5479	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	(None)
	5480	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	(None)
	5481	P1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	(None)
	5482	P1386A Colors special problem binary search constructive algorithms interactive 2700	0 / 0	(None)
	5483	P1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	(None)
	5484	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	(None)
	5485	P1387B2 Village (Maximum) special problem dfs and similar trees 2500	0 / 0	(None)
	5486	P1388A Captain Flint and Crew Recruitment brute force greedy math number theory *800	0 / 0	(None)
	5487	P1388B Captain Flint and a Long Voyage greedy math *1000	0 / 0	(None)
	5488	P1388C Uncle Bogdan and Country Happiness dfs and similar greedy math trees *1800	0 / 0	(None)
	5489	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	(None)
	5490	P1389A LCM Problem constructive algorithms greedy math number theory *800	0 / 0	(None)
	5491	P1389B Array Walk brute force dp greedy *1600	0 / 0	(None)
	5492	P1389D Segment Intersections brute force greedy implementation math *2100	0 / 0	(None)
	5493	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	(None)

Pick a problem randomly based on the current filter.