sortings - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4927	P1082C Multi-Subject Competition greedy sortings *1600	0 / 0	5
	4904	P1088B Ehab and subtraction implementation sortings *1000	0 / 0	3
	4869	P1091E New Year and the Acquaintance Estimation binary search data structures graphs greedy implementation math sortings *2400	0 / 0	9
	4864	P1092B Teams Forming sortings *800	0 / 0	3
	4857	P1093B Letters Rearranging constructive algorithms greedy sortings strings *900	0 / 0	3
	4812	P1101C Division and Union sortings *1500	0 / 0	5
	4806	P1102B Array K-Coloring greedy sortings *1400	0 / 0	4
	4803	P1102E Monotonic Renumeration combinatorics sortings *1700	0 / 0	5
	4787	P1106C Lunar New Year and Number Division greedy implementation math sortings *900	0 / 0	3
	4781	P1107C Brutality greedy sortings two pointers *1300	10 / 27	4
	4778	P1107F Vasya and Endless Credits dp flows graph matchings graphs sortings *2600	0 / 0	10
	4762	P1110B Tape greedy sortings *1400	0 / 0	4
	4759	P1110E Magic Stones constructive algorithms math sortings *2200	0 / 0	8
	4747	P1114B Yet Another Array Partitioning Task constructive algorithms greedy sortings *1500	0 / 0	5
	4722	P1117B Emotes greedy math sortings *1000	0 / 0	3
	4707	P1119B Alyona and a Narrow Fridge binary search flows greedy sortings *1300	0 / 0	4
	4705	P1119D Frets On Fire binary search sortings *1800	0 / 0	6
	4694	P1121A Technogoblet of Fire implementation sortings *1100	0 / 0	3
	4688	P1129C Morse Code binary search data structures dp hashing sortings string suffix structures strings *2400	0 / 0	9
	4680	P1131C Birthday binary search greedy sortings *1200	0 / 0	4
	4674	P1132B Discounts greedy sortings *900	0 / 0	3
	4666	P1133C Balanced Team sortings two pointers *1200	0 / 0	4
	4664	P1133E K Balanced Teams dp sortings two pointers *1800	0 / 0	6
	4659	P1136C Nastya Is Transposing Matrices constructive algorithms sortings *1500	0 / 0	5
	4656	P1137A Skyscrapers implementation sortings *1600	0 / 0	5
	4640	P1140C Playlist brute force data structures sortings *1600	0 / 0	5
	4618	P1144B Parity Alternated Deletions greedy implementation sortings *900	0 / 0	3
	4617	P1144C Two Shuffled Sequences constructive algorithms sortings *1000	0 / 0	3
	4589	P1148C Crazy Diamond constructive algorithms sortings *1700	0 / 0	5
	4588	P1148D Dirty Deeds Done Dirt Cheap greedy sortings *1800	0 / 0	6
	4587	P1148E Earth Wind and Fire constructive algorithms greedy math sortings two pointers *2300	0 / 0	8
	4573	P1151D Stas and the Queue at the Buffet greedy math sortings *1600	0 / 0	5
	4553	P1154E Two Teams data structures implementation sortings *1800	0 / 0	6
	4552	P1154F Shovels Shop dp greedy sortings *2100	0 / 0	7
	4550	P1155A Reverse a Substring implementation sortings strings *1000	0 / 0	3
	4543	P1156B Ugly Pairs dfs and similar greedy implementation sortings strings *1800	0 / 0	6
	4542	P1156C Match Points binary search greedy sortings ternary search two pointers *2000	0 / 0	7
	4529	P1158A The Party and Sweets binary search constructive algorithms greedy implementation math sortings two pointers *1500	0 / 0	5
	4527	P1158C Permutation recovery constructive algorithms data structures dfs and similar graphs greedy math sortings *2100	0 / 0	7
	4509	P1165B Polycarp Training data structures greedy sortings *1000	0 / 0	3
	4506	P1165E Two Arrays and Sum of Functions greedy math sortings *1600	0 / 0	5
	4501	P1166C A Tale of Two Lands binary search sortings two pointers *1500	0 / 0	5
	4492	P1167F Scalar Queries combinatorics data structures math sortings *2300	0 / 0	8
	4465	P1174A Ehab Fails to Be Thanos constructive algorithms greedy sortings *1000	0 / 0	3
	4464	P1174B Ehab Is an Odd Person sortings *1200	0 / 0	4
	4456	P1175D Array Splitting greedy sortings *1900	10 / 20	6
	4449	P1176D Recover it! dfs and similar graphs greedy number theory sortings *1800	0 / 0	6
	4447	P1176F Destroy it! dp implementation sortings *2100	0 / 0	7
	4425	P1181D Irrigation binary search data structures implementation sortings trees two pointers *2200	0 / 0	8
	4424	P1181E1 A Story of One Country (Easy) brute force divide and conquer sortings *2500	0 / 0	9
	4423	P1181E2 A Story of One Country (Hard) brute force greedy sortings *3000	0 / 0	10
	4413	P1183D Candy Box (easy version) greedy sortings *1400	0 / 0	4
	4411	P1183F Topforces Strikes Back brute force math sortings *2100	0 / 0	7
	4410	P1183G Candy Box (hard version) greedy implementation sortings *2000	0 / 0	7
	4405	P1184B1 The Doctor Meets Vader (Easy) binary search sortings *1400	0 / 0	4
	4404	P1184B2 The Doctor Meets Vader (Medium) flows graph matchings graphs shortest paths sortings *2200	0 / 0	8
	4392	P1185C1 Exam in BerSU (easy version) greedy sortings *1200	0 / 0	4
	4377	P1187D Subarray Sorting data structures sortings *2400	0 / 0	9
	4366	P1189B Number Circle greedy math sortings *1100	0 / 0	3
	4361	P1190D Tokitsukaze and Strange Rectangle data structures divide and conquer sortings two pointers *2000	0 / 0	7
	4346	P1194E Count The Rectangles bitmasks brute force data structures geometry sortings *2200	3 / 5	8
	4337	P1195F Geometers Anonymous Club data structures geometry math sortings *2500	0 / 0	9
	4330	P1196F K-th Path brute force constructive algorithms shortest paths sortings *2200	0 / 0	8
	4329	P1197A DIY Wooden Ladder greedy math sortings *900	0 / 0	3
	4327	P1197C Array Splitting greedy sortings *1400	0 / 0	4
	4325	P1197E Culture Code binary search combinatorics data structures dp shortest paths sortings *2300	0 / 0	8
	4323	P1198A MP3 sortings two pointers *1600	0 / 0	5
	4322	P1198B Welfare State binary search brute force data structures sortings *1600	0 / 0	5
	4321	P1198C Matching vs Independent Set constructive algorithms graphs greedy sortings *2000	0 / 0	7
	4307	P1201C Maximum Median binary search greedy math sortings *1400	0 / 0	4
	4292	P1203E Boxers greedy sortings *1500	0 / 0	5
	4277	P1206A Choose Two Numbers math sortings *800	0 / 0	3
	4256	P1209E1 Rotate Columns (easy version) bitmasks brute force dp greedy sortings *2000	0 / 0	7
	4255	P1209E2 Rotate Columns (hard version) bitmasks dp greedy sortings *2500	0 / 0	9
	4240	P1211C Ice Cream special problem greedy sortings 1700	0 / 0	5
	4229	P1213D2 Equalizing by Division (hard version) brute force math sortings *1600	0 / 0	5
	4226	P1213G Path Queries divide and conquer dsu graphs sortings trees *1800	0 / 0	6
	4221	P1214E Petya and Construction Set constructive algorithms graphs math sortings trees *2000	0 / 0	7
	4220	P1214F Employment greedy sortings *2700	0 / 0	10
	4210	P1216B Shooting greedy implementation sortings *900	0 / 0	3
	4187	P1220A Cards implementation sortings strings *800	0 / 0	3
	4175	P1221F Choose a Square binary search data structures sortings *2400	0 / 0	9
	4169	P1223E Paint the Tree dp sortings trees *2100	0 / 0	7
	4125	P1237B Balanced Tunnel data structures sortings two pointers *1300	0 / 0	4
	4123	P1237C2 Balanced Removals (Harder) binary search constructive algorithms divide and conquer greedy implementation sortings *1900	0 / 0	6
	4116	P1238B Kill 'Em All greedy sortings *1300	8 / 26	4
	4111	P1238G Adilbek and the Watering System data structures greedy sortings *2700	0 / 0	10
	4102	P1242B 0-1 MST dfs and similar dsu graphs sortings *1900	0 / 0	6
	4091	P1244E Minimizing Difference binary search constructive algorithms greedy sortings ternary search two pointers *2000	0 / 0	7
	4080	P1248B Grow The Tree greedy math sortings *900	0 / 0	3
	4072	P1249D2 Too Many Segments (hard version) data structures greedy sortings *1800	0 / 0	6
	4052	P1251D Salary Changing binary search greedy sortings *1900	0 / 0	6
	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
	3982	P1256E Yet Another Division Into Teams dp greedy sortings *2000	0 / 0	7
	3980	P1256F Equalizing Two Strings constructive algorithms sortings strings *2000	0 / 0	7
	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
	3957	P1260D A Game with Traps binary search dp greedy sortings *1900	0 / 0	6

Pick a problem randomly based on the current filter.