sortings - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3886	P1267I Intriguing Selection brute force constructive algorithms implementation interactive sortings *2600	0 / 0	10
	3865	P1269B Modulo Equality brute force sortings *1500	0 / 0	5
	3857	P1270D Strange Device constructive algorithms interactive math sortings *1900	0 / 0	6
	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
	3763	P1282B1 K for the Price of One (Easy Version) dp greedy sortings *1400	0 / 0	4
	3762	P1282B2 K for the Price of One (Hard Version) dp greedy sortings *1600	0 / 0	5
	3761	P1282C Petya and Exam greedy sortings two pointers *1800	0 / 0	6
	3745	P1284B New Year and Ascent Sequence binary search combinatorics data structures dp implementation sortings *1400	0 / 0	4
	3743	P1284D New Year and Conference binary search data structures hashing sortings *2100	0 / 0	7
	3741	P1284E New Year and Castle Construction combinatorics geometry math sortings *2500	0 / 0	9
	3729	P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	8
	3726	P1286A Garland dp greedy sortings *1800	0 / 0	6
	3672	P1294B Collecting Packages implementation sortings *1200	0 / 0	4
	3648	P1296D Fight with Monsters greedy sortings *1500	0 / 0	5
	3646	P1296E1 String Coloring (easy version) constructive algorithms dp graphs greedy sortings *1800	0 / 0	6
	3642	P1296F Berland Beauty constructive algorithms dfs and similar greedy sortings trees *2100	0 / 0	7
	3628	P1297B Cartoons *special problem implementation sortings	0 / 0	(None)
	3626	P1297D Bonus Distribution *special problem binary search greedy sortings	0 / 0	(None)
	3624	P1297F Movie Fan *special problem data structures greedy implementation sortings	0 / 0	(None)
	3614	P1300B Assigning to Classes greedy implementation sortings *1000	0 / 0	3
	3588	P1304C Air Conditioner dp greedy implementation sortings two pointers *1500	0 / 0	5
	3583	P1305A Kuroni and the Gifts brute force constructive algorithms greedy sortings *800	0 / 0	3
	3572	P1307D Cow and Fields binary search data structures dfs and similar graphs greedy shortest paths sortings *1900	0 / 0	6
	3567	P1310A Recommendations data structures greedy sortings *1700	0 / 0	5
	3554	P1311B WeirdSort dfs and similar sortings *1200	0 / 0	4
	3545	P1311F Moving Points data structures divide and conquer implementation sortings *1900	0 / 0	6
	3541	P1312B Bogosort constructive algorithms sortings *1000	0 / 0	3
	3521	P1316B String Modification brute force constructive algorithms implementation sortings strings *1400	0 / 1	4
	3515	P1316E Team Building bitmasks dp greedy sortings *2300	0 / 7	8
	3512	P1320A Journey Planning data structures dp greedy math sortings *1400	0 / 0	4
	3508	P1320C World of Darkraft: Battle for Azathoth brute force data structures sortings *2000	0 / 0	7
	3496	P1322B Present binary search bitmasks constructive algorithms data structures math sortings *2100	0 / 0	7
	3478	P1324D Pair of Topics binary search data structures sortings two pointers *1400	0 / 0	4
	3384	P1333D Challenges in school №41 brute force constructive algorithms games graphs greedy implementation sortings *2100	0 / 0	7
	3382	P1333F Kate and imperfection greedy implementation math number theory sortings two pointers *2200	0 / 0	8
	3380	P1334B Middle Class greedy sortings *1100	0 / 0	3
	3370	P1335C Two Teams Composing binary search greedy implementation sortings *1100	0 / 0	3
	3361	P1336A Linova and Kingdom dfs and similar dp greedy sortings trees *1600	0 / 0	5
	3360	P1336B Xenia and Colorful Gems binary search greedy math sortings two pointers *1700	0 / 0	5
	3346	P1339B Sorted Adjacent Differences constructive algorithms sortings *1200	0 / 0	4
	3334	P1342D Multiple Testcases binary search constructive algorithms data structures greedy sortings two pointers *1900	0 / 0	6
	3327	P1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	7
	3325	P1344A Hilbert's Hotel math number theory sortings *1600	0 / 0	5
	3315	P1346C Spring Cleaning special problem greedy sortings 1600	0 / 0	5
	3307	P1348B Phoenix and Beauty constructive algorithms data structures greedy sortings *1400	0 / 0	4
	3306	P1348C Phoenix and Distribution constructive algorithms greedy sortings strings *1600	0 / 0	5
	3282	P1353B Two Arrays And Swaps greedy sortings *800	0 / 0	3
	3280	P1353D Constructing the Array constructive algorithms data structures sortings *1600	0 / 0	5
	3271	P1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	9
	3268	P1355B Young Explorers dp greedy sortings *1200	0 / 0	4
	3265	P1355E Restorer Distance binary search greedy math sortings ternary search *2100	0 / 0	7
	3234	P1358B Maria Breaks the Self-isolation greedy sortings *1000	0 / 0	3
	3222	P1360B Honest Coach greedy sortings *800	0 / 0	3
	3221	P1360C Similar Pairs constructive algorithms graph matchings greedy sortings *1100	0 / 0	3
	3215	P1361A Johnny and Contribution constructive algorithms graphs greedy sortings *1700	0 / 0	5
	3214	P1361B Johnny and Grandmaster greedy implementation math sortings *1900	0 / 0	6
	3190	P1365F Swaps Again constructive algorithms implementation sortings *2100	0 / 0	7
	3178	P1367D Task On The Board constructive algorithms greedy implementation sortings *1800	0 / 0	6
	3175	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	9
	3163	P1369C RationalLee greedy math sortings two pointers *1400	0 / 0	4
	3161	P1369E DeadLee data structures dfs and similar greedy implementation sortings *2400	0 / 0	9
	3148	P1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	6
	3147	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	8
	3129	P1374D Zero Remainder Array math sortings two pointers *1400	0 / 0	4
	3128	P1374E1 Reading Books (easy version) data structures greedy sortings *1600	0 / 0	5
	3127	P1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	0 / 0	9
	3126	P1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	9
	3122	P1375D Replace by MEX brute force constructive algorithms sortings *1900	0 / 0	6
	3121	P1375E Inversion SwapSort constructive algorithms greedy sortings *2500	0 / 0	9
	3114	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	7
	3113	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	8
	3107	P1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	4
	3099	P1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	9
	3097	P1381E Origami geometry math sortings *3300	0 / 0	10
	3094	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	5
	3091	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	10
	3077	P1386B Mixture special problem data structures geometry math sortings 2900	0 / 0	10
	3067	P1388E Uncle Bogdan and Projections data structures geometry sortings *2700	0 / 0	10
	3061	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	10
	3043	P1393C Pinkie Pie Eats Patty-cakes constructive algorithms greedy math sortings *1700	0 / 0	5
	3039	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	6
	3036	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	1 / 3	10
	3028	P1396D Rainbow Rectangles data structures sortings two pointers *3300	0 / 0	10
	3025	P1397B Power Sequence brute force math number theory sortings *1500	0 / 0	5
	3023	P1398B Substring Removal Game games greedy sortings *800	0 / 0	3
	3021	P1398D Colored Rectangles dp greedy sortings *1800	0 / 0	6
	3020	P1398E Two Types of Spells binary search data structures greedy implementation math sortings *2200	0 / 0	8
	3017	P1399A Remove Smallest greedy sortings *800	0 / 0	3
	3012	P1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	8
	3011	P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	8
	3001	P1401C Mere Array constructive algorithms math number theory sortings *1300	0 / 0	4
	3000	P1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	6
	2999	P1401E Divide Square data structures geometry implementation sortings *2400	0 / 0	9
	2997	P1402A Fancy Fence special problem data structures dsu implementation math sortings 1800	0 / 0	6
	2996	P1402B Roads special problem geometry sortings 2900	0 / 0	10
	2994	P1403A The Potion of Great Power special problem 2-sat binary search data structures graphs interactive sortings two pointers 2400	0 / 0	9
	2983	P1406B Maximum Product brute force dp greedy implementation sortings *1200	0 / 0	4
	2971	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	7
	2970	P1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	9

Pick a problem randomly based on the current filter.