graph matchings - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	332	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	(None)
	306	P1592F2 Alice and Recoloring 2 constructive algorithms flows graph matchings greedy *2800	0 / 0	(None)
	203	P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	(None)
	177	P1615G Maximum Adjacent Pairs constructive algorithms graph matchings *3300	0 / 0	(None)
	117	P1624C Division by Two and Permutation constructive algorithms flows graph matchings greedy math *1100	0 / 0	(None)
	80	P1630F Making It Bipartite flows graph matchings graphs number theory *3400	0 / 0	(None)
	61	P1634E Fair Share constructive algorithms data structures dfs and similar graph matchings graphs *2400	0 / 0	(None)
	7676	P1684G Euclid Guess constructive algorithms flows graph matchings math number theory *2800	0 / 0	(None)
	7828	P1710E Two Arrays binary search games graph matchings *2400	0 / 0	(None)
	7890	P1717F Madoka and The First Session brute force constructive algorithms dfs and similar flows graph matchings graphs implementation *2500	0 / 0	(None)
	7860	P1718D Permutation for Burenka graph matchings greedy math trees	0 / 0	(None)
	7877	P1721F Matching Reduction dfs and similar graph matchings graphs interactive	0 / 0	(None)
	7918	P1728F Fishermen flows graph matchings greedy *3100	0 / 0	10
	7964	P1735E House Planning constructive algorithms data structures graph matchings greedy *2400	0 / 0	9
	8159	P1765J Hero to Zero graph matchings math *2900	0 / 0	10
	8133	P1770D Koxia and Game constructive algorithms data structures dfs and similar dsu flows games graph matchings graphs implementation	0 / 0	(None)
	8122	P1773A Amazing Trick constructive algorithms graph matchings math probabilities *1900	0 / 0	6
	8097	P1773D Dominoes combinatorics flows graph matchings greedy *2600	0 / 0	10
	8099	P1783F Double Sort II constructive algorithms dfs and similar flows graph matchings graphs greedy	0 / 0	(None)
	8552	P1835F Good Graph bitmasks dfs and similar graph matchings graphs implementation *3500	0 / 0	10

Pick a problem randomly based on the current filter.