data structures - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3392	P1332G No Monotone Triples data structures *3100	0 / 0	10
	3386	P1333C Eugene and an array binary search data structures implementation two pointers *1700	0 / 0	5
	3375	P1334F Strange Function binary search data structures dp greedy *2500	0 / 0	9
	3366	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	5
	3364	P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	6
	3362	P1335F Robots on a Grid data structures dfs and similar dsu graphs greedy matrices *2200	0 / 0	8
	3355	P1336F Journey data structures divide and conquer graphs trees *3500	0 / 0	10
	3345	P1340A Nastya and Strange Generator brute force data structures greedy implementation *1500	0 / 0	5
	3340	P1340F Nastya and CBS brute force data structures hashing *3300	0 / 0	10
	3334	P1342D Multiple Testcases binary search constructive algorithms data structures greedy sortings two pointers *1900	0 / 0	6
	3328	P1343D Constant Palindrome Sum brute force data structures greedy two pointers *1700	0 / 0	5
	3326	P1343F Restore the Permutation by Sorted Segments brute force constructive algorithms data structures greedy implementation *2400	0 / 0	9
	3321	P1344E Train Tracks data structures trees *3100	0 / 0	10
	3312	P1346F Dune II: Battle For Arrakis special problem data structures greedy math 2000	0 / 0	7
	3310	P1346H Game with Segments special problem data structures games 2700	0 / 0	10
	3307	P1348B Phoenix and Beauty constructive algorithms data structures greedy sortings *1400	0 / 0	4
	3303	P1348F Phoenix and Memory data structures dfs and similar graphs greedy *2600	0 / 0	10
	3302	P1349A Orac and LCM data structures math number theory *1600	0 / 0	5
	3291	P1351C Skier data structures implementation *1400	0 / 0	4
	3280	P1353D Constructing the Array constructive algorithms data structures sortings *1600	0 / 0	5
	3273	P1354D Multiset binary search data structures *1900	0 / 0	6
	3231	P1358E Are You Fired? constructive algorithms data structures greedy implementation *2400	0 / 0	9
	3226	P1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	7
	3224	P1359F RC Kaboom Show binary search brute force data structures geometry math *2900	0 / 0	10
	3210	P1361F Johnny and New Toy data structures implementation math *3300	0 / 0	10
	3200	P1364A XXXXX brute force data structures number theory two pointers *1200	0 / 0	4
	3193	P1365C Rotation Matching constructive algorithms data structures greedy implementation *1400	0 / 0	4
	3182	P1366G Construct the String data structures dp strings *2700	0 / 0	10
	3175	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	9
	3168	P1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	10
	3161	P1369E DeadLee data structures dfs and similar greedy implementation sortings *2400	0 / 0	9
	3155	P1370E Binary Subsequence Rotation binary search constructive algorithms data structures greedy *2100	0 / 0	7
	3146	P1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	10
	3134	P1373F Network Coverage binary search constructive algorithms data structures greedy *2400	0 / 0	9
	3133	P1373G Pawns data structures divide and conquer greedy *2600	0 / 0	10
	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
	3123	P1375C Element Extermination constructive algorithms data structures greedy *1400	0 / 0	4
	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
	3111	P1379F1 Chess Strikes Back (easy version) binary search data structures *2700	0 / 0	10
	3110	P1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	10
	3109	P1380A Three Indices brute force data structures *900	0 / 0	3
	3105	P1380E Merging Towers data structures dsu implementation trees *2300	0 / 0	8
	3104	P1380F Strange Addition data structures dp matrices *2600	0 / 0	10
	3102	P1381A1 Prefix Flip (Easy Version) constructive algorithms data structures strings *1300	0 / 0	4
	3101	P1381A2 Prefix Flip (Hard Version) constructive algorithms data structures implementation strings two pointers *1700	0 / 0	5
	3090	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	10
	3080	P1385F Removing Leaves data structures greedy implementation trees *2300	0 / 0	8
	3077	P1386B Mixture special problem data structures geometry math sortings 2900	0 / 0	10
	3076	P1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	10
	3068	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	7
	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
	3049	P1392F Omkar and Landslide binary search constructive algorithms data structures greedy math *2400	0 / 0	9
	3044	P1393B Applejack and Storages constructive algorithms data structures greedy implementation *1400	0 / 0	4
	3028	P1396D Rainbow Rectangles data structures sortings two pointers *3300	0 / 0	10
	3022	P1398C Good Subarrays data structures dp math *1600	0 / 0	5
	3020	P1398E Two Types of Spells binary search data structures greedy implementation math sortings *2200	0 / 0	8
	3019	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	9
	3014	P1399D Binary String To Subsequences constructive algorithms data structures greedy implementation *1500	0 / 0	5
	3013	P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	7
	3011	P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	8
	3007	P1400D Zigzags brute force combinatorics data structures math two pointers *1900	0 / 0	6
	3006	P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	8
	2999	P1401E Divide Square data structures geometry implementation sortings *2400	0 / 0	9
	2998	P1401F Reverse and Swap binary search bitmasks data structures *2400	0 / 0	9
	2997	P1402A Fancy Fence special problem data structures dsu implementation math sortings 1800	0 / 0	6
	2994	P1403A The Potion of Great Power special problem 2-sat binary search data structures graphs interactive sortings two pointers 2400	0 / 0	9
	2993	P1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	8
	2989	P1404C Fixed Point Removal binary search constructive algorithms data structures greedy two pointers *2300	0 / 0	8
	2981	P1406D Three Sequences constructive algorithms data structures greedy math *2200	0 / 0	8
	2976	P1407D Discrete Centrifugal Jumps data structures dp graphs *2200	0 / 0	8
	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
	2967	P1408H Rainbow Triples binary search data structures flows greedy *3300	0 / 0	10
	2949	P1413D Shurikens data structures greedy implementation *1700	0 / 0	5
	2947	P1413F Roads and Ramen data structures trees *2800	0 / 0	10
	2940	P1416A k-Amazing Numbers binary search data structures implementation two pointers *1500	0 / 0	5
	2938	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	2937	P1416D Graph and Queries data structures dsu graphs implementation trees *2600	0 / 0	10
	2936	P1416E Split binary search data structures dp greedy *3200	0 / 0	10
	2929	P1418D Trash Problem data structures implementation *2100	0 / 0	7
	2927	P1418F Equal Product data structures math number theory two pointers *3000	0 / 0	10
	2926	P1418G Three Occurrences data structures divide and conquer hashing two pointers *2500	0 / 0	9
	2919	P1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	10
	2915	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	7
	2914	P1420D Rescue Nibel! combinatorics data structures sortings *1800	0 / 0	6
	2902	P1422F Boring Queries data structures math number theory *2700	0 / 0	10
	2895	P1423G Growing flowers data structures *3500	0 / 0	10
	2894	P1423H Virus data structures divide and conquer dsu graphs *2500	0 / 0	9
	2887	P1424G Years data structures sortings *1300	0 / 0	4
	2878	P1425I Impressive Harvesting of The Orchard data structures *2800	0 / 0	10
	2874	P1426D Non-zero Segments constructive algorithms data structures greedy sortings *1500	0 / 0	5
	2866	P1427F Boring Card Game data structures greedy trees *3200	0 / 0	10
	2861	P1428C ABBB brute force data structures greedy strings *1100	0 / 0	3
	2859	P1428E Carrots for Rabbits binary search data structures greedy math sortings *2200	0 / 0	8
	2858	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	9
	2852	P1430C Numbers on Whiteboard constructive algorithms data structures greedy implementation math *1000	0 / 0	3
	2851	P1430D String Deletion binary search data structures greedy two pointers *1700	0 / 0	5

Pick a problem randomly based on the current filter.