Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	388	P1776F Train Splitting constructive algorithms graphs greedy *1700	0 / 0	5
	387	P1776G Another Wine Tasting Event combinatorics constructive algorithms math strings *2100	0 / 0	7
	385	P1776H Beppa and SwerChat two pointers *1300	0 / 0	4
	384	P1776I Spinach Pizza games geometry greedy interactive *2500	0 / 0	9
	382	P1776J Italian Data Centers graphs shortest paths *2500	0 / 0	9
	381	P1776K Uniform Chemistry dp math *3200	0 / 0	10
	379	P1776L Controllers binary search math *1500	0 / 0	5
	378	P1776M Parmigiana With Seafood binary search dp greedy trees *3000	0 / 0	10
	376	P1776N Count Permutations math *3500	0 / 0	10
	375	P1777A Everybody Likes Good Arrays! greedy math *800	1 / 1	3
	373	P1777B Emordnilap combinatorics greedy math *900	1 / 1	3
	371	P1777C Quiz Master binary search math number theory sortings two pointers *1700	0 / 0	5
	370	P1777D Score of a Tree bitmasks combinatorics dfs and similar dp math probabilities trees *1900	0 / 0	6
	369	P1777E Edge Reverse binary search dfs and similar graphs trees *2200	0 / 0	8
	367	P1777F Comfortably Numb bitmasks data structures divide and conquer strings trees *2400	0 / 0	9
	365	P1778A Flip Flop Sum greedy implementation *800	2 / 3	3
	364	P1778B The Forbidden Permutation greedy math *1300	0 / 0	4
	363	P1778C Flexible String bitmasks brute force strings *1600	0 / 0	5
	361	P1778D Flexible String Revisit combinatorics dp math probabilities *2100	0 / 0	7
	360	P1778E The Tree Has Fallen! bitmasks dfs and similar math trees *2500	0 / 0	9
	358	P1778F Maximizing Root dfs and similar dp graphs math number theory trees *2600	0 / 0	10
	357	P1779A Hall of Fame constructive algorithms greedy strings *800	0 / 0	3
	355	P1779B MKnez's ConstructiveForces Task constructive algorithms math *900	0 / 0	3
	353	P1779C Least Prefix Sum data structures greedy *1600	0 / 0	5
	352	P1779D Boris and His Amazing Haircut constructive algorithms data structures dp dsu greedy sortings *1700	0 / 0	5
	351	P1779E Anya's Simultaneous Exhibition constructive algorithms graphs greedy interactive sortings *2400	0 / 0	9
	349	P1779F Xorcerer's Stones bitmasks constructive algorithms dp trees *2500	0 / 0	9
	347	P1779G The Game of the Century constructive algorithms graphs shortest paths *3000	0 / 0	10
	346	P1779H Olympic Team Building brute force meet-in-the-middle *3500	0 / 0	10
	344	P1780A Hayato and School constructive algorithms greedy *800	0 / 0	3
	343	P1780B GCD Partition brute force greedy math number theory *1100	0 / 0	3
	341	P1780D Bit Guessing Game binary search bitmasks constructive algorithms interactive *1800	0 / 0	6
	338	P1780E Josuke and Complete Graph binary search brute force data structures math number theory *2400	0 / 0	9
	339	P1780F Three Chairs bitmasks brute force combinatorics data structures dp number theory sortings *2300	0 / 0	8
	337	P1780G Delicious Dessert binary search dsu hashing math number theory string suffix structures *2400	0 / 0	9
	336	P1781A Parallel Projection geometry math *800	0 / 0	3
	333	P1781B Going to the Cinema brute force greedy sortings *1000	0 / 0	3
	332	P1781C Equal Frequencies brute force constructive algorithms greedy implementation sortings strings *1600	0 / 0	5
	331	P1781D Many Perfect Squares brute force math number theory *1800	0 / 0	6
	330	P1781E Rectangle Shrinking binary search brute force data structures greedy implementation two pointers *2300	0 / 0	8
	328	P1781F Bracket Insertion combinatorics dp math trees *2700	0 / 0	10
	326	P1781G Diverse Coloring constructive algorithms trees *3200	0 / 0	10
	325	P1781H1 Window Signals (easy version) *3200	0 / 0	10
	323	P1781H2 Window Signals (hard version) *3500	0 / 0	10
	322	P1783A Make it Beautiful constructive algorithms math sortings *800	1 / 1	3
	320	P1783B Matrix of Differences constructive algorithms math *1100	1 / 1	3
	319	P1783C Yet Another Tournament binary search greedy sortings *1700	0 / 0	5
	318	P1783D Different Arrays brute force dp implementation *2000	0 / 0	7
	316	P1783E Game of the Year brute force data structures math number theory *2300	0 / 0	8
	315	P1783F Double Sort II dfs and similar flows graph matchings graphs *2500	0 / 0	9
	314	P1783G Weighed Tree Radius data structures divide and conquer implementation trees *2800	0 / 0	10
	313	P1784A Monsters (easy version) brute force greedy *1000	0 / 0	3
	312	P1784B Letter Exchange constructive algorithms *1900	0 / 0	6
	311	P1784C Monsters (hard version) data structures greedy *2200	0 / 0	8
	310	P1784D Wooden Spoon combinatorics dp *2400	0 / 0	9
	309	P1784E Infinite Game brute force combinatorics dp games probabilities *3100	0 / 0	10
	308	P1784F Minimums or Medians *3400	0 / 0	10
	307	P1786A1 Non-alternating Deck (easy version) implementation *800	1 / 1	3
	306	P1786A2 Alternating Deck (hard version) implementation *800	1 / 1	3
	305	P1786B Cake Assembly Line brute force sortings *1300	0 / 0	4
	304	P1787A Exponential Equation constructive algorithms math *800	0 / 0	3
	303	P1787B Number Factorization greedy math number theory *1100	0 / 0	3
	301	P1787C Remove the Bracket dp greedy math *1600	0 / 0	5
	299	P1787D Game on Axis combinatorics dfs and similar dsu graphs implementation *1900	0 / 0	6
	298	P1787E The Harmonization of XOR bitmasks constructive algorithms greedy math *2100	0 / 0	7
	297	P1787F Inverse Transformation constructive algorithms implementation math *2500	0 / 0	9
	295	P1787G Colorful Tree Again brute force data structures trees *3000	0 / 0	10
	293	P1787H Codeforces Scoreboard binary search data structures dp geometry *3300	0 / 0	10
	292	P1787I Treasure Hunt data structures divide and conquer two pointers *3400	0 / 0	10
	290	P1788A One and Two brute force implementation math *800	0 / 0	3
	289	P1788B Sum of Two Numbers constructive algorithms greedy implementation math probabilities *1100	0 / 0	3
	288	P1788C Matching Numbers constructive algorithms greedy math *1300	0 / 0	4
	286	P1788D Moving Dots binary search brute force combinatorics math two pointers *2000	0 / 0	7
	285	P1788E Sum Over Zero data structures dfs and similar dp *2200	0 / 0	8
	283	P1788F XOR, Tree, and Queries bitmasks constructive algorithms dfs and similar dsu graphs greedy implementation trees *2500	0 / 0	9
	281	P1789A Serval and Mocha's Array brute force math number theory *800	1 / 1	3
	280	P1789B Serval and Inversion Magic brute force implementation strings two pointers *800	0 / 0	3
	279	P1789C Serval and Toxel's Arrays combinatorics dp implementation math *1500	0 / 0	5
	278	P1789D Serval and Shift-Shift-Shift bitmasks brute force constructive algorithms implementation *2200	0 / 0	8
	277	P1789E Serval and Music Game brute force dp implementation math number theory *2500	0 / 0	9
	276	P1789F Serval and Brain Power bitmasks brute force dp greedy implementation strings *2700	0 / 0	10
	275	P1790A Polycarp and the Day of Pi implementation math strings *800	0 / 0	3
	274	P1790B Taisia and Dice greedy greedy math *800	0 / 0	3
	273	P1790C Premutation brute force implementation math *1000	0 / 0	3
	272	P1790D Matryoshkas data structures greedy sortings *1200	0 / 0	4
	270	P1790E Vlad and a Pair of Numbers bitmasks constructive algorithms *1400	0 / 0	4
	271	P1790F Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy math shortest paths trees *2100	0 / 0	7
	269	P1790G Tokens on Graph constructive algorithms dfs and similar graphs shortest paths *2300	0 / 0	8
	268	P1791A Codeforces Checking implementation strings *800	1 / 1	3
	267	P1791B Following Directions geometry implementation *800	1 / 1	3
	265	P1791C Prepend and Append implementation two pointers *800	1 / 1	3
	264	P1791D Distinct Split brute force greedy strings *1000	1 / 1	3
	263	P1791E Negatives and Positives dp greedy sortings *1100	0 / 0	3
	261	P1791F Range Update Point Query binary search brute force data structures *1500	0 / 0	5
	259	P1791G1 Teleporters (Easy Version) greedy sortings *1100	0 / 0	3
	258	P1791G2 Teleporters (Hard Version) binary search greedy sortings *1900	0 / 0	6
	256	P1792A GamingForces greedy sortings *800	0 / 0	3
	255	P1792B Stand-up Comedian greedy math *1200	0 / 0	4
	254	P1792C Min Max Sort binary search brute force greedy math two pointers *1500	0 / 0	5
	252	P1792D Fixed Prefix Permutations binary search bitmasks data structures hashing math sortings *1700	0 / 0	5

Pick a problem randomly based on the current filter.