graph matchings - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1888	P1284F New Year and Social Network data structures graph matchings graphs math trees *3200	0 / 0	(None)
	1552	P1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	(None)
	1502	P1360C Similar Pairs constructive algorithms graph matchings greedy sortings *1100	0 / 0	(None)
	1400	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(None)
	1380	P1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	(None)
	1342	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	(None)
	1268	P1404E Bricks flows graph matchings graphs *2800	0 / 0	(None)
	1216	P1416F Showing Off flows graph matchings greedy implementation *3300	0 / 0	(None)
	1181	P1423B Valuable Paper binary search flows graph matchings graphs *1900	0 / 0	(None)
	1102	P1437C Chef Monocarp dp flows graph matchings greedy math sortings *1800	0 / 0	(None)
	948	P1470D Strange Housing constructive algorithms dfs and similar graph matchings graphs greedy *2200	0 / 0	(None)
	938	P1472F New Year's Puzzle brute force dp graph matchings greedy sortings *2100	0 / 0	(None)
	745	P1510B Button Lock flows graph matchings graphs *2600	0 / 0	(None)
	744	P1510C Cactus Not Enough dfs and similar graph matchings graphs *2900	0 / 0	(None)
	658	P1525D Armchairs dp flows graph matchings greedy *1800	0 / 0	(None)
	656	P1525F Goblins And Gnomes brute force dp flows graph matchings *2800	0 / 0	(None)
	604	P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(None)
	539	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	(None)
	518	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	(None)
	398	P1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	(None)

Pick a problem randomly based on the current filter.