greedy - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4239	P1211D Teams special problem binary search greedy math 2000	0 / 0	7
	4238	P1211E Double Permutation Inc. special problem binary search greedy 2000	0 / 0	7
	4227	P1213F Unstable String Sort data structures dfs and similar dsu graphs greedy implementation strings *2100	0 / 0	7
	4223	P1214C Bad Sequence data structures greedy *1200	0 / 0	4
	4220	P1214F Employment greedy sortings *2700	0 / 0	10
	4217	P1215A Yellow Cards greedy implementation math *1000	0 / 0	3
	4215	P1215C Swap Letters constructive algorithms greedy *1500	0 / 0	5
	4214	P1215D Ticket Game games greedy math *1700	0 / 0	5
	4210	P1216B Shooting greedy implementation sortings *900	0 / 0	3
	4205	P1216F Wi-Fi data structures dp greedy *2100	0 / 0	7
	4203	P1217B Zmei Gorynich greedy math *1600	0 / 0	5
	4200	P1217E Sum Queries? data structures greedy implementation math *2300	0 / 0	8
	4193	P1218F Workout plan data structures greedy *1500	0 / 0	5
	4190	P1218I The Light Square 2-sat dfs and similar greedy *2100	0 / 0	7
	4185	P1220C Substring Game in the Lesson games greedy strings *1300	0 / 0	4
	4183	P1220E Tourism dfs and similar dp dsu graphs greedy trees *2200	0 / 0	8
	4180	P1221A 2048 Game brute force greedy math *1000	0 / 0	3
	4179	P1221B Knights constructive algorithms greedy *1100	0 / 0	3
	4171	P1223C Save the Nature binary search greedy *1600	0 / 0	5
	4170	P1223D Sequence Sorting dp greedy two pointers *2000	0 / 0	7
	4160	P1225F Tree Factory constructive algorithms greedy trees *2500	0 / 0	9
	4159	P1225G To Make 1 bitmasks constructive algorithms dp greedy number theory *3100	0 / 0	10
	4155	P1227D1 Optimal Subsequences (Easy Version) data structures greedy *1600	0 / 0	5
	4154	P1227D2 Optimal Subsequences (Hard Version) data structures greedy *1800	0 / 0	6
	4142	P1230B Ania and Minimizing greedy implementation *1000	0 / 0	3
	4141	P1231C Increasing Matrix greedy *1100	0 / 0	3
	4140	P1231E Middle-Out constructive algorithms greedy strings *2200	0 / 0	8
	4132	P1236A Stones brute force greedy math *800	0 / 0	3
	4130	P1236C Labs constructive algorithms greedy implementation *1300	0 / 0	4
	4129	P1236D Alice and the Doll brute force data structures greedy implementation *2300	0 / 0	8
	4124	P1237C1 Balanced Removals (Easier) constructive algorithms geometry greedy *1700	0 / 0	5
	4123	P1237C2 Balanced Removals (Harder) binary search constructive algorithms divide and conquer greedy implementation sortings *1900	0 / 0	6
	4119	P1237G Balanced Distribution data structures dp greedy *3500	0 / 0	10
	4116	P1238B Kill 'Em All greedy sortings *1300	8 / 26	4
	4115	P1238C Standard Free2play dp greedy math *1600	5 / 14	5
	4111	P1238G Adilbek and the Watering System data structures greedy sortings *2700	0 / 0	10
	4108	P1239C Queue in the Train data structures greedy implementation *2300	0 / 0	8
	4091	P1244E Minimizing Difference binary search constructive algorithms greedy sortings ternary search two pointers *2000	0 / 0	7
	4089	P1244G Running in Pairs constructive algorithms greedy math *2400	0 / 0	9
	4087	P1245B Restricted RPS constructive algorithms dp greedy *1200	0 / 0	4
	4085	P1245D Shichikuji and Power Grid dsu graphs greedy shortest paths trees *1900	1 / 1	6
	4080	P1248B Grow The Tree greedy math sortings *900	0 / 0	3
	4079	P1248D1 The World Is Just a Programming Task (Easy Version) brute force dp greedy implementation *2000	0 / 0	7
	4075	P1249C1 Good Numbers (easy version) brute force greedy implementation *1300	0 / 0	4
	4074	P1249C2 Good Numbers (hard version) binary search greedy math meet-in-the-middle *1500	0 / 0	5
	4073	P1249D1 Too Many Segments (easy version) greedy *1800	0 / 0	6
	4072	P1249D2 Too Many Segments (hard version) data structures greedy sortings *1800	0 / 0	6
	4068	P1250B The Feast and the Bus brute force constructive algorithms greedy math *1800	0 / 0	6
	4063	P1250G Discarding Game dp greedy two pointers *2300	0 / 0	8
	4061	P1250I Show Must Go On binary search brute force greedy shortest paths *3100	0 / 0	10
	4060	P1250J The Parade binary search greedy *1800	0 / 0	6
	4058	P1250L Divide The Students binary search greedy math *1500	0 / 0	5
	4056	P1250N Wires dfs and similar graphs greedy *2000	0 / 0	7
	4054	P1251B Binary Palindromes greedy strings *1400	0 / 0	4
	4053	P1251C Minimize The Integer greedy two pointers *1600	0 / 0	5
	4052	P1251D Salary Changing binary search greedy sortings *1900	0 / 0	6
	4050	P1251E1 Voting (Easy Version) data structures dp greedy *2300	0 / 0	8
	4047	P1251E2 Voting (Hard Version) binary search data structures greedy *2400	0 / 0	9
	4036	P1252E Songwriter greedy two pointers *2200	0 / 0	8
	4029	P1252H Twin Buildings greedy implementation *1800	0 / 0	6
	4017	P1253B Silly Mistake greedy implementation *1400	0 / 0	4
	4015	P1253C Sweets Eating dp greedy math sortings *1500	0 / 0	5
	4013	P1253D Harmonious Graph constructive algorithms dfs and similar dsu graphs greedy sortings *1700	0 / 0	5
	4011	P1253E Antenna Coverage data structures dp greedy sortings *2200	0 / 0	8
	4007	P1254A Feeding Chicken constructive algorithms greedy implementation *1700	0 / 0	5
	4005	P1254B1 Send Boxes to Alice (Easy Version) constructive algorithms greedy math number theory ternary search two pointers *1800	0 / 0	6
	4003	P1254B2 Send Boxes to Alice (Hard Version) constructive algorithms greedy math number theory ternary search two pointers *2100	0 / 0	7
	3987	P1256B Minimize the Permutation greedy *1400	0 / 0	4
	3986	P1256C Platforms Jumping greedy *1700	0 / 0	5
	3983	P1256D Binary String Minimizing greedy *1500	0 / 0	5
	3982	P1256E Yet Another Division Into Teams dp greedy sortings *2000	0 / 0	7
	3977	P1257A Two Rival Students greedy math *800	0 / 0	3
	3973	P1257C Dominated Subarray greedy implementation sortings strings two pointers *1200	0 / 0	4
	3972	P1257D Yet Another Monster Killing Problem binary search data structures dp greedy sortings two pointers *1700	0 / 0	5
	3969	P1257E The Contest data structures dp greedy *2000	0 / 0	7
	3966	P1257G Divisor Set divide and conquer fft greedy math number theory *2600	0 / 0	10
	3960	P1260C Infinite Fence greedy math number theory *1700	0 / 0	5
	3957	P1260D A Game with Traps binary search dp greedy sortings *1900	0 / 0	6
	3955	P1260E Tournament brute force dp greedy *2400	0 / 0	9
	3947	P1263B PIN Codes greedy implementation *1400	0 / 0	4
	3938	P1264A Beautiful Regional Contest greedy implementation *1500	0 / 0	5
	3936	P1264B Beautiful Sequence brute force constructive algorithms greedy *1900	0 / 0	6
	3924	P1265A Beautiful String constructive algorithms greedy *1000	0 / 0	3
	3914	P1266C Diverse Matrix constructive algorithms greedy math number theory *1400	0 / 0	4
	3911	P1266D Decreasing Debts constructive algorithms data structures graphs greedy implementation math two pointers *2000	0 / 0	7
	3909	P1266E Spaceship Solitaire data structures greedy implementation *2100	0 / 0	7
	3893	P1267E Elections greedy *1700	0 / 0	5
	3883	P1267J Just Arrange the Icons greedy implementation math *1800	0 / 0	6
	3877	P1268A Long Beautiful Integer constructive algorithms greedy implementation strings *1700	0 / 0	5
	3876	P1268B Domino for Young dp greedy math *2000	0 / 0	7
	3863	P1270A Card Game games greedy math *800	0 / 0	3
	3861	P1270B Interesting Subarray constructive algorithms greedy math *1200	0 / 0	4
	3848	P1271A Suits brute force greedy math *800	0 / 0	3
	3846	P1271B Blocks greedy math *1300	1 / 1	4
	3843	P1271C Shawarma Tent brute force geometry greedy implementation *1300	1 / 1	4
	3841	P1271D Portals data structures dp greedy implementation sortings *2100	0 / 0	7
	3836	P1272A Three Friends brute force greedy math sortings *900	0 / 0	3
	3834	P1272B Snow Walking Robot constructive algorithms greedy implementation *1200	0 / 0	4
	3824	P1276A As Simple as One and Two dp greedy *1400	0 / 0	4
	3819	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.