graph matchings - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9670	P21D Traveling Graph bitmasks graph matchings graphs *2400	0 / 0	9
	9321	P86B Tetris revisited constructive algorithms graph matchings greedy math *2200	0 / 0	8
	9249	P103E Buying Sets flows graph matchings *2900	0 / 0	10
	9180	P120H Brevity is Soul of Wit graph matchings *1800	0 / 0	6
	8978	P166D Shoe Store dp graph matchings greedy sortings two pointers *2500	0 / 0	9
	8973	P167D Wizards and Roads data structures divide and conquer graph matchings graphs greedy *3000	0 / 0	10
	8516	P266B Queue at the School constructive algorithms graph matchings implementation shortest paths *800	0 / 0	3
	8421	P290C WTF? special problem graph matchings implementation trees 1700	0 / 0	5
	8324	P316C2 Tidying Up flows graph matchings *2300	0 / 0	8
	8165	P353E Antichain dp graph matchings greedy *2200	0 / 0	8
	8025	P387D George and Interesting Graph graph matchings *2200	0 / 0	8
	7712	P468B Two Sets 2-sat dfs and similar dsu graph matchings greedy *2000	0 / 0	7
	7710	P468D Tree graph matchings *3100	0 / 0	10
	7709	P468E Permanent dp graph matchings math meet-in-the-middle *3100	0 / 0	10
	7628	P489B BerSU Ball dfs and similar dp graph matchings greedy sortings two pointers *1200	0 / 0	4
	7615	P491C Deciphering flows graph matchings *2300	0 / 0	8
	7588	P498C Array and Operations flows graph matchings number theory *2100	0 / 0	7
	7264	P575C Party bitmasks brute force graph matchings *2700	0 / 0	10
	7199	P590E Birthday graph matchings strings *3200	0 / 0	10
	7075	P618D Hamiltonian Spanning Tree dfs and similar dp graph matchings greedy trees *2200	0 / 0	8
	6558	P737E Tanya is 5! graph matchings graphs greedy schedules *3300	0 / 0	10
	6553	P739D Recover a functional graph graph matchings *3400	0 / 0	10
	6287	P793G Oleg and chess data structures divide and conquer flows graph matchings *3400	0 / 0	10
	5949	P852D Exploration plan binary search flows graph matchings shortest paths *2100	0 / 0	7
	5794	P891D Sloth dfs and similar dp graph matchings trees *3100	0 / 0	10
	5409	P981F Round Marriage binary search graph matchings greedy *2500	0 / 0	9
	5250	P1009G Allowed Letters bitmasks flows graph matchings graphs greedy *2400	0 / 0	9
	5185	P1027F Session in BSU binary search dfs and similar dsu graph matchings graphs *2400	0 / 0	9
	5141	P1034B Little C Loves 3 II brute force constructive algorithms flows graph matchings *2200	0 / 0	8
	5084	P1045A Last chance data structures flows graph matchings graphs trees *2500	0 / 0	9
	5056	P1054F Electric Scheme flows graph matchings *2700	0 / 0	10
	4985	P1067E Random Forest Rank dp graph matchings math trees *2800	0 / 0	10
	4973	P1070I Privatization of Roads in Berland flows graph matchings graphs *2400	0 / 0	9
	4778	P1107F Vasya and Endless Credits dp flows graph matchings graphs sortings *2600	0 / 0	10
	4644	P1139E Maximize Mex flows graph matchings graphs *2400	0 / 0	9
	4433	P1179C Serge and Dining Room binary search data structures graph matchings greedy implementation math trees *2200	0 / 0	8
	4404	P1184B2 The Doctor Meets Vader (Medium) flows graph matchings graphs shortest paths sortings *2200	0 / 0	8
	4319	P1198E Rectangle Painting 2 flows graph matchings graphs *2500	0 / 0	9
	4107	P1239D Catowice City 2-sat dfs and similar graph matchings graphs *2400	0 / 0	9
	3928	P1264E Beautiful League constructive algorithms flows graph matchings *2700	0 / 0	10
	3740	P1284F New Year and Social Network data structures graph matchings graphs math trees *3200	0 / 0	10
	3271	P1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	9
	3221	P1360C Similar Pairs constructive algorithms graph matchings greedy sortings *1100	0 / 0	3
	3119	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	10
	3099	P1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	9
	3061	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	10
	2987	P1404E Bricks flows graph matchings graphs *2800	0 / 0	10
	2935	P1416F Showing Off flows graph matchings greedy implementation *3300	0 / 0	10
	2900	P1423B Valuable Paper binary search flows graph matchings graphs *1900	0 / 0	6
	2821	P1437C Chef Monocarp dp flows graph matchings greedy math sortings *1800	0 / 0	6
	2620	P1470D Strange Housing constructive algorithms dfs and similar graph matchings graphs greedy *2200	0 / 0	8
	2603	P1472F New Year's Puzzle brute force dp graph matchings greedy sortings *2100	0 / 0	7
	2311	P1510B Button Lock flows graph matchings graphs *2600	0 / 0	10
	2309	P1510C Cactus Not Enough dfs and similar graph matchings graphs *2900	0 / 0	10
	2191	P1525D Armchairs dp flows graph matchings greedy *1800	0 / 0	6
	2189	P1525F Goblins And Gnomes brute force dp flows graph matchings *2800	0 / 0	10
	2128	P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(None)
	2048	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	10
	2020	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	3
	1835	P1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	10
	1738	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	8
	1699	P1592F2 Alice and Recoloring 2 constructive algorithms flows graph matchings greedy *2800	0 / 0	10
	1555	P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	9
	1529	P1615G Maximum Adjacent Pairs constructive algorithms graph matchings *3300	0 / 0	10
	1469	P1624C Division by Two and Permutation constructive algorithms flows graph matchings greedy math *1100	0 / 0	3
	1414	P1630F Making It Bipartite flows graph matchings graphs number theory *3400	0 / 0	10
	1391	P1634E Fair Share constructive algorithms data structures dfs and similar graph matchings graphs *2400	0 / 0	9
	1313	P1651E Sum of Matchings brute force combinatorics constructive algorithms dfs and similar graph matchings greedy math *2600	0 / 0	10
	1290	P1657E Star MST combinatorics dp graph matchings math *2200	0 / 0	8
	1116	P1684G Euclid Guess constructive algorithms flows graph matchings math number theory *2800	0 / 0	10
	915	P1710E Two Arrays binary search games graph matchings *2400	0 / 0	9
	875	P1717F Madoka and The First Session constructive algorithms flows graph matchings graphs implementation *2500	0 / 0	9
	870	P1718D Permutation for Burenka data structures graph matchings greedy math trees *3300	0 / 0	10
	853	P1721F Matching Reduction brute force constructive algorithms dfs and similar flows graph matchings graphs interactive *2800	0 / 0	10
	819	P1728F Fishermen flows graph matchings greedy *3100	0 / 0	10
	775	P1735E House Planning constructive algorithms data structures graph matchings greedy *2400	0 / 0	9
	515	P1765A Access Levels bitmasks dsu flows graph matchings *2400	0 / 0	9
	499	P1765J Hero to Zero graph matchings math *2900	0 / 0	10
	458	P1770D Koxia and Game constructive algorithms data structures dfs and similar dsu flows games graph matchings graphs implementation *2000	0 / 0	7
	435	P1773A Amazing Trick constructive algorithms graph matchings math probabilities *1900	0 / 0	6
	432	P1773D Dominoes combinatorics flows graph matchings greedy *2600	0 / 0	10
	315	P1783F Double Sort II dfs and similar flows graph matchings graphs *2500	0 / 0	9
	9934	P1835F Good Graph bitmasks dfs and similar graph matchings graphs implementation *3500	0 / 0	10
	10213	P1896F Bracket Xoring bitmasks constructive algorithms graph matchings implementation *2600	0 / 0	10
	10227	P1914F Programming Competition dfs and similar dp graph matchings greedy trees *1900	0 / 0	6
	10442	P1949I Disks dfs and similar geometry graph matchings graphs	0 / 0	(None)
	10482	P1955H The Most Reckless Defense bitmasks brute force constructive algorithms dp flows graph matchings shortest paths	0 / 0	(None)
	10734	P1991I Grid Game constructive algorithms games graph matchings greedy interactive	0 / 0	(None)

Pick a problem randomly based on the current filter.