data structures - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	10357	P1941E Rudolf and k Bridges binary search data structures dp two pointers *1600	0 / 0	5
	10526	P1942D Learning to Paint binary search data structures dfs and similar dp greedy implementation sortings	0 / 0	(None)
	10524	P1942F Farmer John's Favorite Function brute force data structures implementation math	0 / 0	(None)
	10522	P1942H Farmer John's Favorite Intern data structures dp flows trees	0 / 0	(None)
	10459	P1945F Kirill and Mushrooms data structures sortings *1900	0 / 0	6
	10458	P1945G Cook and Porridge binary search constructive algorithms data structures implementation *2500	0 / 0	9
	10457	P1945H GCD is Greater brute force data structures math number theory *2600	0 / 0	10
	10451	P1946F Nobody is needed brute force data structures dp math number theory *2500	0 / 0	9
	10513	P1951B Battle Cows binary search data structures greedy	0 / 0	(None)
	10509	P1951F Inversion Composition constructive algorithms data structures greedy	0 / 0	(None)
	10491	P1954E Chain Reaction binary search data structures dsu greedy implementation math number theory	0 / 0	(None)
	10488	P1955B Progressive Square constructive algorithms data structures implementation sortings	0 / 0	(None)
	10486	P1955D Inaccurate Subsequence Search data structures two pointers	0 / 0	(None)
	10481	P1956A Nene's Game binary search brute force data structures games greedy	0 / 0	(None)
	10475	P1956F Nene and the Passing Game constructive algorithms data structures dsu graphs sortings	0 / 0	(None)
	10625	P1965F Conference data structures flows *3300	0 / 0	10
	10619	P1967C Fenwick Tree bitmasks brute force combinatorics data structures dp math trees *2300	0 / 0	8
	10615	P1967F Next and Prev brute force data structures implementation *3200	0 / 0	10
	10609	P1968F Equal XOR Segments binary search data structures *1800	0 / 0	6
	10608	P1968G1 Division + LCP (easy version) binary search data structures dp hashing string suffix structures strings *1900	0 / 0	6
	10607	P1968G2 Division + LCP (hard version) binary search brute force data structures dp hashing math string suffix structures strings *2200	0 / 0	8
	10603	P1969D Shop Game data structures greedy math sortings *1900	0 / 0	6
	10602	P1969E Unique Array binary search data structures divide and conquer dp greedy *2400	0 / 0	9
	10573	P1971G XOUR data structures dsu sortings *1400	0 / 0	4
	10568	P1973B Cat, Fox and the Lonely Array binary search bitmasks data structures greedy math two pointers *1300	0 / 0	4
	10561	P1974C Beautiful Triple Pairs combinatorics data structures *1400	0 / 0	4
	10558	P1974F Cutting Game binary search brute force data structures implementation sortings two pointers *1900	0 / 0	6
	10557	P1974G Money Buys Less Happiness Now data structures greedy sortings *2000	0 / 0	7
	10552	P1975E Chain Queries binary search data structures dfs and similar implementation trees *2100	0 / 0	7
	10544	P1976D Invertible Bracket Sequences binary search combinatorics data structures divide and conquer implementation two pointers	0 / 0	(None)
	10543	P1976E Splittable Permutations combinatorics data structures dfs and similar greedy math trees	0 / 0	(None)
	10542	P1976F Remove Bridges data structures dfs and similar dp greedy sortings trees	0 / 0	(None)
	10539	P1977C Nikita and LCM brute force data structures dp greedy math number theory sortings *1900	0 / 0	6
	10696	P1978C Manhattan Permutations constructive algorithms data structures greedy implementation math *1300	0 / 0	4
	10695	P1978D Elections data structures greedy implementation math *1600	0 / 0	5
	10694	P1978E Computing Machine brute force data structures dp greedy implementation *2000	0 / 0	7
	10693	P1978F Large Graph data structures dfs and similar dsu graphs number theory two pointers *2400	0 / 0	9
	10688	P1979E Manhattan Triangle binary search constructive algorithms data structures geometry implementation two pointers *2400	0 / 0	9
	10682	P1980E Permutation of Rows and Columns constructive algorithms data structures greedy hashing implementation math matrices sortings *1600	0 / 0	5
	10681	P1980F1 Field Division (easy version) data structures math sortings *1900	0 / 0	6
	10679	P1980G Yasya and the Mysterious Tree bitmasks data structures dfs and similar graphs greedy strings trees *2300	0 / 0	8
	10532	P1981E Turtle and Intersected Segments data structures dsu graphs greedy math	0 / 0	(None)
	10531	P1981F Turtle and Paths on a Tree data structures dp trees	0 / 0	(None)
	10676	P1982C Boring Day binary search data structures dp greedy two pointers *1200	0 / 0	4
	10675	P1982D Beauty of the mountains brute force data structures implementation math number theory *1700	0 / 0	5
	10673	P1982F Sorting Problem Again binary search data structures sortings *2600	0 / 0	10
	10658	P1985F Final Boss binary search data structures *1500	0 / 0	5
	10656	P1985H1 Maximize the Largest Component (Easy Version) brute force data structures dfs and similar dsu graphs implementation *1700	0 / 0	5
	10655	P1985H2 Maximize the Largest Component (Hard Version) data structures dfs and similar dp dsu implementation *2200	0 / 0	8
	10653	P1986B Matrix Stabilization brute force data structures greedy sortings *1000	0 / 0	3
	10652	P1986C Update Queries data structures greedy sortings *1100	0 / 0	3
	10648	P1986G1 Permutation Problem (Simple Version) binary search brute force combinatorics data structures math number theory *2200	0 / 0	8
	10647	P1986G2 Permutation Problem (Hard Version) brute force data structures hashing math number theory *2500	0 / 0	9
	10642	P1987E Wonderful Tree! brute force data structures dfs and similar dsu greedy trees *2000	0 / 0	7
	10751	P1988E Range Minimum Sum binary search brute force data structures divide and conquer implementation *2300	0 / 0	8
	10633	P1989D Smithing Skill brute force data structures dp greedy math sortings two pointers *1900	0 / 0	6
	10745	P1990E1 Catch the Mole(Easy Version) binary search data structures dfs and similar interactive trees *2500	0 / 0	9
	10744	P1990E2 Catch the Mole(Hard Version) binary search data structures dfs and similar divide and conquer interactive trees *2600	0 / 0	10
	10743	P1990F Polygonal Segments brute force data structures divide and conquer dp greedy two pointers *2800	0 / 0	10
	10716	P1995B2 Bouquet (Hard Version) binary search data structures greedy math sortings two pointers *1700	0 / 0	5
	10713	P1995E1 Let Me Teach You a Lesson (Easy Version) 2-sat data structures dp matrices two pointers *2700	0 / 0	10
	10712	P1995E2 Let Me Teach You a Lesson (Hard Version) data structures dp matrices two pointers *2900	0 / 0	10
	10705	P1996G Penacony brute force data structures greedy hashing	0 / 0	(None)
	10702	P1997C Even Positions data structures greedy	0 / 0	(None)
	10700	P1997E Level Up binary search brute force data structures divide and conquer implementation	0 / 0	(None)

Pick a problem randomly based on the current filter.