flows - 题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	2585	P1510B Button Lock flows graph matchings graphs *2600	0 / 0	10
	2530	P1517G Starry Night Camping constructive algorithms flows graphs *3300	0 / 0	10
	2523	P1519F Chests and Keys bitmasks brute force dfs and similar dp flows *3200	0 / 0	10
	2498	P1525D Armchairs dp flows graph matchings greedy *1800	0 / 0	6
	2496	P1525F Goblins And Gnomes brute force dp flows graph matchings *2800	0 / 0	10
	2471	P1530D Secret Santa constructive algorithms flows graphs greedy math *1600	0 / 0	5
	2452	P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(无)
	2366	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	3
	2246	P1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	10
	2154	P1592F2 Alice and Recoloring 2 constructive algorithms flows graph matchings greedy *2800	0 / 0	10
	2024	P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	10
	1965	P1624C Division by Two and Permutation constructive algorithms flows graph matchings greedy math *1100	0 / 0	3
	1928	P1630F Making It Bipartite flows graph matchings graphs number theory *3400	0 / 0	10
	1762	P1662J Training Camp flows graphs	0 / 0	(无)
	1733	P1666K Kingdom Partition flows *3200	0 / 0	10
	1632	P1682F MCMF? data structures flows graphs greedy sortings two pointers *2700	0 / 0	10
	1625	P1684G Euclid Guess constructive algorithms flows graph matchings math number theory *2800	0 / 0	10
	1496	P1706C Qpwoeirut And The City dp flows greedy implementation *1400	0 / 0	4
	1479	P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	9
	1434	P1717F Madoka and The First Session constructive algorithms flows graph matchings graphs implementation *2500	0 / 0	9
	1412	P1721F Matching Reduction brute force constructive algorithms dfs and similar flows graph matchings graphs interactive *2800	0 / 0	10
	1378	P1728F Fishermen flows graph matchings greedy *3100	0 / 0	10
	1290	P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	8
	1261	P1746G Olympiad Training binary search data structures dp flows geometry implementation sortings *3500	0 / 0	10
	1251	P1748E Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees *2300	0 / 0	8
	1175	P1765A Access Levels bitmasks dsu flows graph matchings *2400	0 / 0	9
	1156	P1766F MCF flows *2800	0 / 0	10
	1140	P1770D Koxia and Game constructive algorithms data structures dfs and similar dsu flows games graph matchings graphs implementation *2000	0 / 0	7
	1126	P1773D Dominoes combinatorics flows graph matchings greedy *2600	0 / 0	10
	1047	P1783F Double Sort II dfs and similar flows graph matchings graphs *2500	0 / 0	9
	969	P1797A Li Hua and Maze constructive algorithms flows graphs greedy implementation *800	0 / 0	3
	635	P1852F Panda Meetups data structures dp flows *3500	0 / 0	10
	587	P1861F Four Suits binary search bitmasks flows greedy *3200	0 / 0	10
	555	P1866G Grouped Carriages binary search data structures dp flows greedy *2100	0 / 0	7
	411	P1895G Two Characters, Two Colors binary search data structures dp flows greedy *3100	0 / 0	10
	294	P1913E Matrix Problem flows graphs *2400	0 / 0	9
	248	P1919F2 Wine Factory (Hard Version) data structures dp flows greedy matrices *2800	0 / 0	10
	204	P1926G Vlad and Trouble at MIT dfs and similar dp flows graphs greedy implementation trees *1900	0 / 0	6
	97	P1942H Farmer John's Favorite Intern data structures dp flows trees *3500	0 / 0	10
	39	P1951I Growing Trees binary search constructive algorithms flows graphs greedy *3200	0 / 0	10
	15	P1955H The Most Reckless Defense bitmasks brute force constructive algorithms dp flows graph matchings shortest paths *2300	0 / 0	8

根据当前过滤条件随机选择一道题