Problem Set - flows - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8966	P62E World Evil dp flows *2700	0 / 0	10
	8780	P78E Evacuation flows graphs shortest paths *2300	0 / 0	8
	8677	P103E Buying Sets flows graph matchings *2900	0 / 0	10
	8582	P126E Pills brute force flows *2900	0 / 0	10
	8552	P132E Bits of merry old England flows graphs *2700	0 / 0	10
	8417	P164C Machine Programming flows graphs *2400	0 / 0	9
	8166	P212A Privatization flows graphs *3000	0 / 0	10
	8116	P223E Planar Graph flows geometry graphs *3000	0 / 0	10
	8058	P237E Build String flows graphs *2000	0 / 0	7
	7929	P269C Flawed Flow constructive algorithms flows graphs greedy *2100	0 / 0	7
	7896	P277E Binary Tree on Plane flows trees *2400	0 / 0	9
	7885	P280D k-Maximum Subsequence Sum data structures flows graphs implementation *2800	0 / 0	10
	7771	P311E Biologist flows *2300	0 / 0	8
	7752	P316C1 Tidying Up flows *2200	0 / 0	8
	7751	P316C2 Tidying Up flows graph matchings *2300	0 / 0	8
	7723	P321B Ciel and Duel dp flows greedy *1900	0 / 0	6
	7632	P343E Pumping Stations brute force dfs and similar divide and conquer flows graphs greedy trees *2900	0 / 0	10
	7556	P362E Petya and Pipes flows graphs shortest paths *2300	0 / 0	8
	7268	P434D Nanami's Power Plant flows *2900	0 / 0	10
	7172	P457E Flow Optimality constructive algorithms flows math *3000	0 / 0	10
	7033	P491C Deciphering flows graph matchings *2300	0 / 0	8
	7006	P498C Array and Operations flows graph matchings number theory *2100	0 / 0	7
	6960	P510E Fox And Dinner flows *2300	0 / 0	8
	6949	P513F1 Scaygerboss flows *2700	0 / 0	10
	6948	P513F2 Scaygerboss flows *2800	0 / 0	10
	6819	P546E Soldier and Traveling flows graphs math *2100	0 / 0	7
	6451	P611H New Year and Forgotten Tree constructive algorithms flows graphs *3200	0 / 0	10
	6367	P628F Bear and Fair Set flows graphs *2500	0 / 0	9
	6268	P653D Delivery Bears binary search flows graphs *2200	0 / 0	8
	6070	P704D Captain America flows greedy *3100	0 / 0	10
	6053	P708D Incorrect Flow flows *2900	0 / 0	10
	6013	P717G Underfail flows *2400	0 / 0	9
	6003	P720B Cactusophobia dfs and similar flows *2400	0 / 0	9
	5983	P723E One-Way Reform constructive algorithms dfs and similar flows graphs greedy *2200	0 / 0	8
	5977	P724E Goods transportation dp flows greedy *2900	0 / 0	10
	5964	P727D T-shirts Distribution constructive algorithms flows greedy *1800	0 / 0	6
	5947	P730I Olympiad in Programming and Sports dp flows graphs greedy *2000	0 / 0	7
	5913	P736E Chess Championship constructive algorithms flows greedy math *2900	0 / 0	10
	5906	P739E Gosha is hunting brute force data structures dp flows math probabilities sortings *3000	0 / 0	10
	5691	P786E ALT data structures flows graphs trees *3200	0 / 0	10
	5668	P793G Oleg and chess data structures divide and conquer flows graph matchings *3400	0 / 0	10
	5632	P802C Heidi and Library (hard) flows *2600	0 / 0	10
	5621	P802N April Fools' Problem (medium) binary search flows graphs *2400	0 / 0	9
	5620	P802O April Fools' Problem (hard) binary search data structures flows *2900	0 / 0	10
	5597	P808F Card Game binary search flows graphs *2400	0 / 0	9
	5575	P813D Two Melodies dp flows *2600	0 / 0	10
	5548	P818G Four Melodies flows graphs *2600	0 / 0	10
	5454	P843E Maximum Flow flows graphs *3000	0 / 0	10
	5429	P847J Students Initiation binary search flows graphs *2400	0 / 0	9
	5422	P848D Shake It! combinatorics dp flows graphs *2900	0 / 0	10
	5407	P852D Exploration plan binary search flows graph matchings shortest paths *2100	0 / 0	7
	5356	P863F Almost Permutation flows *2200	0 / 0	8
	5289	P877F Ann and Books data structures flows hashing *2300	0 / 0	8
	5263	P884F Anti-Palindromize flows graphs greedy *2500	0 / 0	9
	5202	P899E Segments Removal data structures dsu flows implementation two pointers *2000	0 / 0	7
	5182	P903G Yet Another Maxflow Problem data structures flows graphs *2700	0 / 0	10
	5032	P925F Parametric Circulation binary search flows *3100	0 / 0	10
	4870	P965D Single-use Stones binary search flows greedy two pointers *1900	0 / 0	6
	4856	P976F Minimal k-covering flows graphs *2500	0 / 0	9
	4667	P1009G Allowed Letters bitmasks flows graph matchings graphs greedy *2400	0 / 0	9
	4640	P1016D Vasya And The Matrix constructive algorithms flows math *1800	0 / 0	6
	4615	P1023G Pisces data structures flows trees *3400	0 / 0	10
	4558	P1034B Little C Loves 3 II brute force constructive algorithms flows graph matchings *2200	0 / 0	8
	4501	P1045A Last chance data structures flows graph matchings graphs trees *2500	0 / 0	9
	4473	P1054F Electric Scheme flows graph matchings *2700	0 / 0	10
	4435	P1061E Politics flows graphs *2600	0 / 0	10
	4390	P1070I Privatization of Roads in Berland flows graph matchings graphs *2400	0 / 0	9
	4340	P1082G Petya and Graph flows graphs *2400	0 / 0	9
	4195	P1107F Vasya and Endless Credits dp flows graph matchings graphs sortings *2600	0 / 0	10
	4124	P1119B Alyona and a Narrow Fridge binary search flows greedy sortings *1300	0 / 0	4
	4061	P1139E Maximize Mex flows graph matchings graphs *2400	0 / 0	9
	4016	P1146G Zoning Restrictions dp flows graphs *2700	0 / 0	10
	3853	P1178H Stock Exchange binary search flows graphs *3500	0 / 0	10
	3821	P1184B2 The Doctor Meets Vader (Medium) flows graph matchings graphs shortest paths sortings *2200	0 / 0	8
	3820	P1184B3 The Doctor Meets Vader (Hard) flows shortest paths *2700	0 / 0	10
	3791	P1187G Gang Up flows graphs *2500	0 / 0	9
	3736	P1198E Rectangle Painting 2 flows graph matchings graphs *2500	0 / 0	9
	3639	P1214D Treasure Island dfs and similar dp flows hashing *1900	0 / 0	6
	3476	P1250K Projectors flows graphs *3100	0 / 0	10
	3454	P1252L Road Construction flows graphs *2300	0 / 0	8
	3413	P1263F Economic Difficulties data structures dfs and similar dp flows graphs trees *2400	0 / 0	9
	3407	P1264E Beautiful League constructive algorithms flows graph matchings *2700	0 / 0	10
	3286	P1288F Red-Blue Graph constructive algorithms flows *2900	0 / 0	10
	3189	P1307G Cow and Exercise flows graphs shortest paths *3100	0 / 0	10
	2972	P1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	9
	2868	P1368H1 Breadboard Capacity (easy version) dp flows greedy *3300	0 / 0	10
	2790	P1383F Special Edges flows graphs *3200	0 / 0	10
	2688	P1404E Bricks flows graph matchings graphs *2800	0 / 0	10
	2668	P1408H Rainbow Triples binary search data structures flows greedy *3300	0 / 0	10
	2636	P1416F Showing Off flows graph matchings greedy implementation *3300	0 / 0	10
	2601	P1423B Valuable Paper binary search flows graph matchings graphs *1900	0 / 0	6
	2574	P1426E Rock, Paper, Scissors brute force constructive algorithms flows greedy math *1800	0 / 0	6
	2566	P1427G One Billion Shades of Grey flows graphs *3300	0 / 0	10
	2549	P1430G Yet Another DAG Problem bitmasks dfs and similar dp flows graphs math *2600	0 / 0	10
	2522	P1437C Chef Monocarp dp flows graph matchings greedy math sortings *1800	0 / 0	6
	2515	P1438C Engineer Artem 2-sat chinese remainder theorem constructive algorithms fft flows *2000	0 / 0	7
	2437	P1455E Four Points brute force constructive algorithms flows geometry greedy implementation math ternary search *2400	0 / 0	9
	2351	P1473F Strange Set flows math *2700	0 / 0	10
	2287	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	8
	2270	P1488I Demonic Invasion special problem flows 3100	0 / 0	10

Pick a problem randomly based on the current filter.