Problem Set - greedy - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3656	P1211D Teams special problem binary search greedy math 2000	0 / 0	7
	3655	P1211E Double Permutation Inc. special problem binary search greedy 2000	0 / 0	7
	3644	P1213F Unstable String Sort data structures dfs and similar dsu graphs greedy implementation strings *2100	0 / 0	7
	3640	P1214C Bad Sequence data structures greedy *1200	0 / 0	4
	3637	P1214F Employment greedy sortings *2700	0 / 0	10
	3634	P1215A Yellow Cards greedy implementation math *1000	0 / 0	3
	3632	P1215C Swap Letters constructive algorithms greedy *1500	0 / 0	5
	3631	P1215D Ticket Game games greedy math *1700	0 / 0	5
	3627	P1216B Shooting greedy implementation sortings *900	0 / 0	3
	3622	P1216F Wi-Fi data structures dp greedy *2100	0 / 0	7
	3620	P1217B Zmei Gorynich greedy math *1600	0 / 0	5
	3617	P1217E Sum Queries? data structures greedy implementation math *2300	0 / 0	8
	3610	P1218F Workout plan data structures greedy *1500	0 / 0	5
	3607	P1218I The Light Square 2-sat dfs and similar greedy *2100	0 / 0	7
	3602	P1220C Substring Game in the Lesson games greedy strings *1300	0 / 0	4
	3600	P1220E Tourism dfs and similar dp dsu graphs greedy trees *2200	0 / 0	8
	3597	P1221A 2048 Game brute force greedy math *1000	0 / 0	3
	3596	P1221B Knights constructive algorithms greedy *1100	0 / 0	3
	3588	P1223C Save the Nature binary search greedy *1600	0 / 0	5
	3587	P1223D Sequence Sorting dp greedy two pointers *2000	0 / 0	7
	3577	P1225F Tree Factory constructive algorithms greedy trees *2500	0 / 0	9
	3576	P1225G To Make 1 bitmasks constructive algorithms dp greedy number theory *3100	0 / 0	10
	3572	P1227D1 Optimal Subsequences (Easy Version) data structures greedy *1600	0 / 0	5
	3571	P1227D2 Optimal Subsequences (Hard Version) data structures greedy *1800	0 / 0	6
	3559	P1230B Ania and Minimizing greedy implementation *1000	0 / 0	3
	3558	P1231C Increasing Matrix greedy *1100	0 / 0	3
	3557	P1231E Middle-Out constructive algorithms greedy strings *2200	0 / 0	8
	3549	P1236A Stones brute force greedy math *800	0 / 0	3
	3547	P1236C Labs constructive algorithms greedy implementation *1300	0 / 0	4
	3546	P1236D Alice and the Doll brute force data structures greedy implementation *2300	0 / 0	8
	3541	P1237C1 Balanced Removals (Easier) constructive algorithms geometry greedy *1700	0 / 0	5
	3540	P1237C2 Balanced Removals (Harder) binary search constructive algorithms divide and conquer greedy implementation sortings *1900	0 / 0	6
	3536	P1237G Balanced Distribution data structures dp greedy *3500	0 / 0	10
	3533	P1238B Kill 'Em All greedy sortings *1300	0 / 0	4
	3532	P1238C Standard Free2play dp greedy math *1600	0 / 0	5
	3528	P1238G Adilbek and the Watering System data structures greedy sortings *2700	0 / 0	10
	3525	P1239C Queue in the Train data structures greedy implementation *2300	0 / 0	8
	3508	P1244E Minimizing Difference binary search constructive algorithms greedy sortings ternary search two pointers *2000	0 / 0	7
	3506	P1244G Running in Pairs constructive algorithms greedy math *2400	0 / 0	9
	3504	P1245B Restricted RPS constructive algorithms dp greedy *1200	0 / 0	4
	3502	P1245D Shichikuji and Power Grid dsu graphs greedy shortest paths trees *1900	0 / 0	6
	3497	P1248B Grow The Tree greedy math sortings *900	0 / 0	3
	3496	P1248D1 The World Is Just a Programming Task (Easy Version) brute force dp greedy implementation *2000	0 / 0	7
	3492	P1249C1 Good Numbers (easy version) brute force greedy implementation *1300	0 / 0	4
	3491	P1249C2 Good Numbers (hard version) binary search greedy math meet-in-the-middle *1500	0 / 0	5
	3490	P1249D1 Too Many Segments (easy version) greedy *1800	0 / 0	6
	3489	P1249D2 Too Many Segments (hard version) data structures greedy sortings *1800	0 / 0	6
	3485	P1250B The Feast and the Bus brute force constructive algorithms greedy math *1800	0 / 0	6
	3480	P1250G Discarding Game dp greedy two pointers *2300	0 / 0	8
	3478	P1250I Show Must Go On binary search brute force greedy shortest paths *3100	0 / 0	10
	3477	P1250J The Parade binary search greedy *1800	0 / 0	6
	3475	P1250L Divide The Students binary search greedy math *1500	0 / 0	5
	3473	P1250N Wires dfs and similar graphs greedy *2000	0 / 0	7
	3471	P1251B Binary Palindromes greedy strings *1400	0 / 0	4
	3470	P1251C Minimize The Integer greedy two pointers *1600	0 / 0	5
	3469	P1251D Salary Changing binary search greedy sortings *1900	0 / 0	6
	3468	P1251E1 Voting (Easy Version) data structures dp greedy *2300	0 / 0	8
	3467	P1251E2 Voting (Hard Version) binary search data structures greedy *2400	0 / 0	9
	3461	P1252E Songwriter greedy two pointers *2200	0 / 0	8
	3458	P1252H Twin Buildings greedy implementation *1800	0 / 0	6
	3452	P1253B Silly Mistake greedy implementation *1400	0 / 0	4
	3451	P1253C Sweets Eating dp greedy math sortings *1500	0 / 0	5
	3450	P1253D Harmonious Graph constructive algorithms dfs and similar dsu graphs greedy sortings *1700	0 / 0	5
	3449	P1253E Antenna Coverage data structures dp greedy sortings *2200	0 / 0	8
	3447	P1254A Feeding Chicken constructive algorithms greedy implementation *1700	0 / 0	5
	3446	P1254B1 Send Boxes to Alice (Easy Version) constructive algorithms greedy math number theory ternary search two pointers *1800	0 / 0	6
	3445	P1254B2 Send Boxes to Alice (Hard Version) constructive algorithms greedy math number theory ternary search two pointers *2100	0 / 0	7
	3437	P1256B Minimize the Permutation greedy *1400	0 / 0	4
	3436	P1256C Platforms Jumping greedy *1700	0 / 0	5
	3435	P1256D Binary String Minimizing greedy *1500	0 / 0	5
	3434	P1256E Yet Another Division Into Teams dp greedy sortings *2000	0 / 0	7
	3432	P1257A Two Rival Students greedy math *800	0 / 0	3
	3430	P1257C Dominated Subarray greedy implementation sortings strings two pointers *1200	0 / 0	4
	3429	P1257D Yet Another Monster Killing Problem binary search data structures dp greedy sortings two pointers *1700	0 / 0	5
	3428	P1257E The Contest data structures dp greedy *2000	0 / 0	7
	3426	P1257G Divisor Set divide and conquer fft greedy math number theory *2600	0 / 0	10
	3423	P1260C Infinite Fence greedy math number theory *1700	0 / 0	5
	3422	P1260D A Game with Traps binary search dp greedy sortings *1900	0 / 0	6
	3421	P1260E Tournament brute force dp greedy *2400	0 / 0	9
	3417	P1263B PIN Codes greedy implementation *1400	0 / 0	4
	3412	P1264A Beautiful Regional Contest greedy implementation *1500	0 / 0	5
	3411	P1264B Beautiful Sequence brute force constructive algorithms greedy *1900	0 / 0	6
	3405	P1265A Beautiful String constructive algorithms greedy *1000	0 / 0	3
	3400	P1266C Diverse Matrix constructive algorithms greedy math number theory *1400	0 / 0	4
	3399	P1266D Decreasing Debts constructive algorithms data structures graphs greedy implementation math two pointers *2000	0 / 0	7
	3398	P1266E Spaceship Solitaire data structures greedy implementation *2100	0 / 0	7
	3390	P1267E Elections greedy *1700	0 / 0	5
	3385	P1267J Just Arrange the Icons greedy implementation math *1800	0 / 0	6
	3382	P1268A Long Beautiful Integer constructive algorithms greedy implementation strings *1700	0 / 0	5
	3381	P1268B Domino for Young dp greedy math *2000	0 / 0	7
	3375	P1270A Card Game games greedy math *800	0 / 0	3
	3374	P1270B Interesting Subarray constructive algorithms greedy math *1200	0 / 0	4
	3366	P1271A Suits brute force greedy math *800	0 / 0	3
	3365	P1271B Blocks greedy math *1300	0 / 0	4
	3364	P1271C Shawarma Tent brute force geometry greedy implementation *1300	0 / 0	4
	3363	P1271D Portals data structures dp greedy implementation sortings *2100	0 / 0	7
	3360	P1272A Three Friends brute force greedy math sortings *900	0 / 0	3
	3359	P1272B Snow Walking Robot constructive algorithms greedy implementation *1200	0 / 0	4
	3354	P1276A As Simple as One and Two dp greedy *1400	0 / 0	4
	3352	P1276C Beautiful Rectangle brute force combinatorics constructive algorithms data structures greedy math *2300	0 / 0	8

Pick a problem randomly based on the current filter.