Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3084	P1385B Restore the Permutation by Merger greedy *800	0 / 0	3
	3083	P1385C Make It Good greedy *1200	0 / 0	4
	3082	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	5
	3081	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	7
	3080	P1385F Removing Leaves data structures greedy implementation trees *2300	0 / 0	8
	3079	P1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	8
	3078	P1386A Colors special problem binary search constructive algorithms interactive 2700	0 / 0	10
	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
	3075	P1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	7
	3074	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	7
	3073	P1387B2 Village (Maximum) special problem dfs and similar trees 2500	0 / 0	9
	3072	P1387C Viruses special problem dp shortest paths string suffix structures 2900	0 / 0	10
	3071	P1388A Captain Flint and Crew Recruitment brute force greedy math number theory *800	0 / 0	3
	3070	P1388B Captain Flint and a Long Voyage greedy math *1000	0 / 0	3
	3069	P1388C Uncle Bogdan and Country Happiness dfs and similar greedy math trees *1800	0 / 0	6
	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
	3066	P1389A LCM Problem constructive algorithms greedy math number theory *800	0 / 0	3
	3065	P1389B Array Walk brute force dp greedy *1600	0 / 0	5
	3064	P1389C Good String brute force dp greedy two pointers *1500	0 / 0	5
	3063	P1389D Segment Intersections brute force greedy implementation math *2100	0 / 0	7
	3062	P1389E Calendar Ambiguity math number theory *2200	0 / 0	8
	3061	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	10
	3060	P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	10
	3059	P1391A Suborrays constructive algorithms math *800	0 / 0	3
	3058	P1391B Fix You brute force greedy implementation *800	0 / 0	3
	3057	P1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	5
	3056	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	7
	3055	P1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	10
	3054	P1392A Omkar and Password greedy math *800	0 / 0	3
	3053	P1392B Omkar and Infinity Clock implementation math *800	0 / 0	3
	3052	P1392C Omkar and Waterslide greedy implementation *1200	0 / 0	4
	3051	P1392D Omkar and Bed Wars dp greedy *1700	0 / 0	5
	3050	P1392E Omkar and Duck bitmasks constructive algorithms interactive math *2100	0 / 0	7
	3049	P1392F Omkar and Landslide binary search constructive algorithms data structures greedy math *2400	0 / 0	9
	3048	P1392G Omkar and Pies bitmasks dfs and similar dp math shortest paths *2900	0 / 0	10
	3047	P1392H ZS Shuffles Cards combinatorics dp math probabilities *3000	0 / 0	10
	3046	P1392I Kevin and Grid fft graphs math *3300	0 / 0	10
	3045	P1393A Rainbow Dash, Fluttershy and Chess Coloring greedy math *800	0 / 0	3
	3044	P1393B Applejack and Storages constructive algorithms data structures greedy implementation *1400	0 / 0	4
	3043	P1393C Pinkie Pie Eats Patty-cakes constructive algorithms greedy math sortings *1700	0 / 0	5
	3042	P1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	7
	3041	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	10
	3040	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	10
	3039	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	6
	3038	P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	8
	3037	P1394C Boboniu and String binary search geometry ternary search *2600	0 / 0	10
	3036	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	1 / 3	10
	3035	P1394E Boboniu and Banknote Collection strings *3500	0 / 0	10
	3034	P1395A Boboniu Likes to Color Balls brute force math *1000	0 / 0	3
	3033	P1395B Boboniu Plays Chess constructive algorithms *1100	0 / 0	3
	3032	P1395C Boboniu and Bit Operations bitmasks brute force dp greedy *1600	0 / 0	5
	3031	P1396A Multiples of Length constructive algorithms greedy number theory *1600	0 / 0	5
	3030	P1396B Stoned Game brute force constructive algorithms games greedy *1800	0 / 0	6
	3029	P1396C Monster Invaders dp greedy implementation *2300	0 / 0	8
	3028	P1396D Rainbow Rectangles data structures sortings two pointers *3300	0 / 0	10
	3027	P1396E Distance Matching constructive algorithms dfs and similar trees *3200	0 / 0	10
	3026	P1397A Juggling Letters greedy strings *800	0 / 0	3
	3025	P1397B Power Sequence brute force math number theory sortings *1500	0 / 0	5
	3024	P1398A Bad Triangle geometry math *800	0 / 0	3
	3023	P1398B Substring Removal Game games greedy sortings *800	0 / 0	3
	3022	P1398C Good Subarrays data structures dp math *1600	0 / 0	5
	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
	3019	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	9
	3018	P1398G Running Competition bitmasks fft math number theory *2600	0 / 0	10
	3017	P1399A Remove Smallest greedy sortings *800	0 / 0	3
	3016	P1399B Gifts Fixing greedy *800	0 / 0	3
	3015	P1399C Boats Competition brute force greedy two pointers *1200	0 / 0	4
	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
	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
	3010	P1400A String Similarity constructive algorithms strings *800	0 / 0	3
	3009	P1400B RPG Protagonist brute force greedy math *1700	0 / 0	5
	3008	P1400C Binary String Reconstruction 2-sat brute force constructive algorithms greedy *1500	0 / 0	5
	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
	3005	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	10
	3004	P1400G Mercenaries bitmasks brute force combinatorics dp dsu math two pointers *2600	0 / 0	10
	3003	P1401A Distance and Axis constructive algorithms math *900	0 / 0	3
	3002	P1401B Ternary Sequence constructive algorithms greedy math *1100	0 / 0	3
	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
	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
	2996	P1402B Roads special problem geometry sortings 2900	0 / 0	10
	2995	P1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	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
	2993	P1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	8
	2992	P1403C Chess Rush special problem combinatorics dp implementation math 3200	0 / 0	10
	2991	P1404A Balanced Bitstring implementation strings *1500	0 / 0	5
	2990	P1404B Tree Tag dfs and similar dp games trees *1900	0 / 0	6
	2989	P1404C Fixed Point Removal binary search constructive algorithms data structures greedy two pointers *2300	0 / 0	8
	2988	P1404D Game of Pairs constructive algorithms dfs and similar interactive math number theory *2800	0 / 0	10
	2987	P1404E Bricks flows graph matchings graphs *2800	0 / 0	10
	2986	P1405A Permutation Forgery constructive algorithms *800	0 / 0	3
	2985	P1405B Array Cancellation constructive algorithms implementation *1000	0 / 0	3

Pick a problem randomly based on the current filter.