Problem Set - flows - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2165	codeforces#P1510B Button Lock flows graph matchings graphs *2600	0 / 0	10
	2110	codeforces#P1517G Starry Night Camping constructive algorithms flows graphs *3300	0 / 0	10
	2103	codeforces#P1519F Chests and Keys bitmasks brute force dfs and similar dp flows *3200	0 / 0	10
	2078	codeforces#P1525D Armchairs dp flows graph matchings greedy *1800	0 / 0	6
	2076	codeforces#P1525F Goblins And Gnomes brute force dp flows graph matchings *2800	0 / 0	10
	2051	codeforces#P1530D Secret Santa constructive algorithms flows graphs greedy math *1600	0 / 0	5
	2032	codeforces#P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(None)
	1946	codeforces#P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	3
	1826	codeforces#P1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	10
	1734	codeforces#P1592F2 Alice and Recoloring 2 constructive algorithms flows graph matchings greedy *2800	0 / 0	10
	1604	codeforces#P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	10
	1545	codeforces#P1624C Division by Two and Permutation constructive algorithms flows graph matchings greedy math *1100	0 / 0	3
	1508	codeforces#P1630F Making It Bipartite flows graph matchings graphs number theory *3400	0 / 0	10
	1351	codeforces#P1662J Training Camp flows graphs	0 / 0	(None)
	1322	codeforces#P1666K Kingdom Partition flows *3200	0 / 0	10
	1221	codeforces#P1682F MCMF? data structures flows graphs greedy sortings two pointers *2700	0 / 0	10
	1214	codeforces#P1684G Euclid Guess constructive algorithms flows graph matchings math number theory *2800	0 / 0	10
	1085	codeforces#P1706C Qpwoeirut And The City dp flows greedy implementation *1400	0 / 0	4
	1068	codeforces#P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	9
	1023	codeforces#P1717F Madoka and The First Session constructive algorithms flows graph matchings graphs implementation *2500	0 / 0	9
	1001	codeforces#P1721F Matching Reduction brute force constructive algorithms dfs and similar flows graph matchings graphs interactive *2800	0 / 0	10
	967	codeforces#P1728F Fishermen flows graph matchings greedy *3100	0 / 0	10
	879	codeforces#P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	8
	850	codeforces#P1746G Olympiad Training binary search data structures dp flows geometry implementation sortings *3500	0 / 0	10
	840	codeforces#P1748E Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees *2300	0 / 0	8
	764	codeforces#P1765A Access Levels bitmasks dsu flows graph matchings *2400	0 / 0	9
	745	codeforces#P1766F MCF flows *2800	0 / 0	10
	729	codeforces#P1770D Koxia and Game constructive algorithms data structures dfs and similar dsu flows games graph matchings graphs implementation *2000	0 / 0	7
	715	codeforces#P1773D Dominoes combinatorics flows graph matchings greedy *2600	0 / 0	10
	636	codeforces#P1783F Double Sort II dfs and similar flows graph matchings graphs *2500	0 / 0	9
	558	codeforces#P1797A Li Hua and Maze constructive algorithms flows graphs greedy implementation *800	0 / 0	3
	224	codeforces#P1852F Panda Meetups data structures dp flows *3500	0 / 0	10
	176	codeforces#P1861F Four Suits binary search bitmasks flows greedy *3200	0 / 0	10
	144	codeforces#P1866G Grouped Carriages binary search data structures dp flows greedy *2100	0 / 0	7
	1	codeforces#P1895G Two Characters, Two Colors binary search data structures dp flows greedy *3100	0 / 0	10
	6661	codeforces#P1913E Matrix Problem flows graphs *2400	0 / 0	9
	7319	codeforces#P1919F2 Wine Factory (Hard Version) data structures dp flows greedy matrices *2800	0 / 0	10
	8918	codeforces#P1926G Vlad and Trouble at MIT dfs and similar dp flows graphs greedy implementation trees	0 / 0	(None)
	9372	codeforces#P1965F Conference data structures flows *3300	0 / 0	10

Pick a problem randomly based on the current filter.