*2000 - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9822	P1827B1 Range Sorting (Easy Version) binary search dp dsu greedy trees two pointers *2000	0 / 0	7
	9982	P1857G Counting Graphs combinatorics divide and conquer dsu graphs greedy sortings trees *2000	0 / 0	7
	10182	P1893C Freedom of Choice brute force greedy implementation *2000	0 / 0	7
	10193	P1900D Small GCD bitmasks brute force dp math number theory *2000	0 / 0	7
	10301	P1910F Build Railway Stations special problem greedy trees 2000	0 / 0	7
	10295	P1912B Blueprint for Seating combinatorics divide and conquer math *2000	0 / 0	7
	10417	P1931G One-Dimensional Puzzle combinatorics math number theory *2000	0 / 0	7
	10389	P1936B Pinball binary search data structures implementation math two pointers *2000	0 / 0	7
	10355	P1941G Rudolf and Subway constructive algorithms dfs and similar graphs shortest paths *2000	0 / 0	7
	10473	P1943B Non-Palindromic Substring hashing implementation math strings *2000	0 / 0	7
	10587	P1970E2 Trails (Medium) dp matrices *2000	0 / 0	7
	10557	P1974G Money Buys Less Happiness Now data structures greedy sortings *2000	0 / 0	7
	10694	P1978E Computing Machine brute force data structures dp greedy implementation *2000	0 / 0	7
	10668	P1984D "a" String Problem brute force hashing implementation math string suffix structures strings *2000	0 / 0	7
	10642	P1987E Wonderful Tree! brute force data structures dfs and similar dsu greedy trees *2000	0 / 0	7
	10752	P1988D The Omnipotent Monster Killer brute force dfs and similar dp trees *2000	0 / 0	7
	10727	P1992G Ultra-Meow combinatorics dp math *2000	0 / 0	7
	10722	P1994E Wooden Game bitmasks greedy math trees *2000	0 / 0	7

Pick a problem randomly based on the current filter.