Problem Set - greedy - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1502	P1632D New Year Concert binary search data structures greedy math number theory two pointers *2000	0 / 0	7
	1498	P1633B Minority greedy *800	0 / 0	3
	1496	P1633D Make Them Equal dp greedy *1600	0 / 0	5
	1495	P1633E Spanning Tree Queries binary search data structures dfs and similar dsu graphs greedy math sortings trees *2400	0 / 0	9
	1493	P1634A Reverse and Concatenate greedy strings *800	0 / 0	3
	1487	P1635A Min Or Sum bitmasks greedy *800	0 / 0	3
	1486	P1635B Avoid Local Maximums greedy *800	0 / 0	3
	1485	P1635C Differential Sorting constructive algorithms greedy *1200	0 / 0	4
	1483	P1635E Cars 2-sat constructive algorithms dfs and similar dsu graphs greedy sortings *2200	0 / 0	8
	1482	P1635F Closest Pair data structures greedy *2800	0 / 0	10
	1480	P1637B MEX and Array brute force dp greedy math *1100	0 / 0	3
	1479	P1637C Andrew and Stones greedy implementation *1200	0 / 0	4
	1478	P1637D Yet Another Minimization Problem dp greedy math *1800	0 / 0	6
	1476	P1637F Towers constructive algorithms dfs and similar dp greedy trees *2500	0 / 0	9
	1475	P1637G Birthday constructive algorithms greedy math *3000	0 / 0	10
	1474	P1637H Minimize Inversions Number data structures greedy math sortings *3500	0 / 0	10
	1473	P1638A Reverse constructive algorithms greedy math *800	0 / 0	3
	1470	P1638D Big Brush constructive algorithms data structures greedy implementation *2000	0 / 0	7
	1468	P1638F Two Posters brute force data structures greedy two pointers *3200	0 / 0	10
	1456	P1641A Great Sequence brute force greedy sortings *1200	0 / 0	4
	1454	P1641C Anonymity Is Important binary search brute force data structures dsu greedy sortings *2200	0 / 0	8
	1453	P1641D Two Arrays bitmasks brute force combinatorics greedy hashing math two pointers *2700	0 / 0	10
	1449	P1642B Power Walking greedy *900	0 / 0	3
	1446	P1644C Increase Subarray Sums brute force dp greedy implementation *1400	0 / 0	4
	1441	P1646B Quality vs Quantity brute force constructive algorithms greedy sortings two pointers *800	0 / 0	3
	1437	P1646F Playing Around the Table constructive algorithms greedy implementation *2900	0 / 0	10
	1434	P1647C Madoka and Childish Pranks constructive algorithms greedy *1300	0 / 0	4
	1432	P1647E Madoka and the Sixth-graders data structures dfs and similar greedy *2500	0 / 0	9
	1431	P1647F Madoka and Laziness dp greedy *3100	0 / 0	10
	1423	P1649B Game of Ball Passing greedy implementation *1300	0 / 0	4
	1420	P1650C Weight of the System of Nested Segments greedy hashing implementation sortings *1200	0 / 0	4
	1418	P1650E Rescheduling the Exam binary search data structures greedy implementation math sortings *1900	0 / 0	6
	1417	P1650F Vitaly and Advanced Useless Algorithms dp greedy implementation *2200	0 / 0	8
	1414	P1651B Prove Him Wrong constructive algorithms greedy *800	0 / 0	3
	1411	P1651E Sum of Matchings brute force combinatorics constructive algorithms dfs and similar graph matchings greedy math *2600	0 / 0	10
	1409	P1654A Maximum Cake Tastiness brute force greedy implementation sortings *800	0 / 0	3
	1407	P1654C Alice and the Cake data structures greedy implementation sortings *1400	0 / 0	4
	1404	P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	10
	1403	P1654G Snowy Mountain data structures dfs and similar graphs greedy shortest paths trees *2900	0 / 0	10
	1400	P1656B Subtract Operation data structures greedy math two pointers *1100	0 / 0	3
	1396	P1656F Parametric MST binary search constructive algorithms graphs greedy math sortings *2600	0 / 0	10
	1391	P1657B XY Sequence greedy *800	0 / 0	3
	1390	P1657C Bracket Sequence Deletion greedy implementation *1200	0 / 0	4
	1389	P1657D For Gamers binary search brute force greedy math sortings *2000	0 / 0	7
	1380	P1658F Juju and Binary String brute force constructive algorithms greedy math *2700	0 / 0	10
	1379	P1659A Red Versus Blue constructive algorithms greedy implementation math *1000	0 / 0	3
	1378	P1659B Bit Flipping bitmasks constructive algorithms greedy strings *1300	0 / 0	4
	1377	P1659C Line Empire binary search brute force dp greedy implementation math *1500	0 / 0	5
	1376	P1659D Reverse Sort Sum constructive algorithms data structures greedy implementation math two pointers *1900	0 / 0	6
	1373	P1660A Vasya and Coins greedy math *800	0 / 0	3
	1371	P1660C Get an Even String dp greedy strings *1300	0 / 0	4
	1369	P1660E Matrix and Shifts brute force constructive algorithms greedy implementation *1600	0 / 0	5
	1366	P1661A Array Balancing greedy math *800	0 / 0	3
	1365	P1661B Getting Zero bitmasks brute force dfs and similar dp graphs greedy shortest paths *1300	0 / 0	4
	1364	P1661C Water the Trees binary search greedy math *1700	0 / 0	5
	1363	P1661D Progressions Covering data structures greedy *1900	0 / 0	6
	1361	P1661F Teleporters binary search greedy *2600	0 / 0	10
	1359	P1662B Toys greedy strings	0 / 0	(None)
	1357	P1662D Evolution of Weasels greedy implementation strings	0 / 0	(None)
	1354	P1662G Gastronomic Event dp greedy trees	0 / 0	(None)
	1336	P1665B Array Cloning Technique constructive algorithms greedy sortings *900	0 / 0	3
	1335	P1665C Tree Infection binary search greedy sortings trees *1600	0 / 0	5
	1333	P1665E MinimizOR bitmasks brute force data structures divide and conquer greedy implementation two pointers *2500	0 / 0	9
	1329	P1666D Deletive Editing greedy *900	0 / 0	3
	1328	P1666E Even Split binary search constructive algorithms greedy math *2500	0 / 0	9
	1320	P1667A Make it Increasing brute force greedy math *1300	0 / 0	4
	1313	P1668B Social Distance greedy math sortings *900	0 / 0	3
	1310	P1669C Odd/Even Increments greedy greedy implementation math *800	0 / 0	3
	1307	P1669F Eating Candies binary search data structures greedy two pointers *1100	0 / 0	3
	1305	P1669H Maximal AND bitmasks greedy math *1300	0 / 0	4
	1304	P1670A Prof greedy implementation sortings *800	0 / 0	3
	1301	P1670D Very Suspicious binary search brute force geometry greedy implementation math *1700	0 / 0	5
	1296	P1671C Dolce Vita binary search brute force greedy math *1200	0 / 0	4
	1295	P1671D Insert a Progression brute force constructive algorithms greedy *1600	0 / 0	5
	1290	P1672C Unequal Array constructive algorithms greedy implementation *1100	0 / 0	3
	1289	P1672D Cyclic Rotation constructive algorithms greedy implementation two pointers *1700	0 / 0	5
	1288	P1672E notepad.exe binary search constructive algorithms greedy interactive *2200	0 / 0	8
	1287	P1672F1 Array Shuffling constructive algorithms graphs greedy *2000	0 / 0	7
	1284	P1672H Zigu Zagu constructive algorithms data structures greedy *2700	0 / 0	10
	1283	P1672I PermutationForces data structures greedy *3000	0 / 0	10
	1282	P1673A Subtle Substring Subtraction games greedy strings *800	0 / 0	3
	1281	P1673B A Perfectly Balanced String? brute force greedy strings *1100	0 / 0	3
	1277	P1673F Anti-Theft Road Planning bitmasks constructive algorithms divide and conquer greedy interactive math *2400	0 / 0	9
	1272	P1674E Breaking the Wall binary search brute force constructive algorithms greedy math *2000	0 / 0	7
	1271	P1674F Desktop Rearrangement data structures greedy implementation *1800	0 / 0	6
	1269	P1675A Food for Animals greedy math *800	0 / 0	3
	1268	P1675B Make It Increasing greedy implementation *900	0 / 0	3
	1265	P1675E Replace With the Previous, Minimize dsu greedy strings *1500	0 / 0	5
	1264	P1675F Vlad and Unfinished Business dfs and similar dp greedy trees *1800	0 / 0	6
	1261	P1676B Equal Candies greedy math sortings *800	0 / 0	3
	1260	P1676C Most Similar Words brute force greedy implementation implementation math strings *800	0 / 0	3
	1259	P1676D X-Sum brute force greedy implementation *1000	0 / 0	3
	1258	P1676E Eating Queries binary search greedy sortings *1100	0 / 0	3
	1257	P1676F Longest Strike data structures greedy implementation sortings two pointers *1300	0 / 0	4
	1251	P1677C Tokitsukaze and Two Colorful Tapes constructive algorithms dfs and similar graphs greedy *1900	0 / 0	6
	1245	P1678B2 Tokitsukaze and Good 01-String (hard version) dp greedy implementation *1800	0 / 0	6
	1244	P1679A AvtoBus brute force greedy math number theory *900	0 / 0	3
	1236	P1680C Binary String binary search greedy strings two pointers *1600	0 / 0	5
	1235	P1680D Dog Walking brute force greedy math *2400	0 / 0	9
	1234	P1680E Moving Chips bitmasks dp greedy *2000	0 / 0	7

Pick a problem randomly based on the current filter.