*3500 - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	729	P1740I Arranging Crystal Balls data structures divide and conquer divide and conquer dp geometry graphs number theory *3500	0 / 0	10
	668	P1746G Olympiad Training binary search data structures dp flows geometry implementation sortings *3500	0 / 0	10
	622	P1750H BinaryStringForces constructive algorithms data structures dp *3500	0 / 0	10
	609	P1753F Minecraft Series brute force two pointers *3500	0 / 0	10
	557	P1761F2 Anti-median (Hard Version) combinatorics dp math *3500	0 / 0	10
	556	P1761G Centroid Guess interactive probabilities trees *3500	0 / 0	10
	449	P1770H Koxia, Mahiru and Winter Festival constructive algorithms *3500	0 / 0	10
	423	P1773L Lisa's Sequences dp *3500	0 / 0	10
	406	P1774H Maximum Permutation constructive algorithms *3500	0 / 0	10
	390	P1776E Crossing the Railways data structures dp *3500	0 / 0	10
	376	P1776N Count Permutations math *3500	0 / 0	10
	346	P1779H Olympic Team Building brute force meet-in-the-middle *3500	0 / 0	10
	323	P1781H2 Window Signals (hard version) *3500	0 / 0	10
	143	P1804G Flow Control data structures dsu implementation *3500	0 / 0	10
	41	P1815F OH NO1 (-2-3-4) constructive algorithms graphs math *3500	0 / 0	10
	9797	P1817F Entangled Substrings string suffix structures strings *3500	0 / 0	10
	30	P1819F Willy-nilly, Crack, Into Release! data structures dp *3500	0 / 0	10
	9817	P1827F Copium Permutation constructive algorithms data structures greedy *3500	0 / 0	10
	9935	P1835E Old Mobile combinatorics dp probabilities *3500	0 / 0	10
	9934	P1835F Good Graph bitmasks dfs and similar graph matchings graphs implementation *3500	0 / 0	10
	9923	P1842I Tenzing and Necklace divide and conquer dp greedy *3500	0 / 0	10
	9944	P1852F Panda Meetups data structures dp flows *3500	0 / 0	10
	9997	P1854F Mark and Spaceship brute force dp *3500	0 / 0	10
	10123	P1870H Standard Graph Problem data structures graphs greedy trees *3500	0 / 0	10
	10180	P1893E Cacti Symphony combinatorics dfs and similar dp graphs *3500	0 / 0	10
	10210	P1896H2 Cyclic Hamming (Hard Version) brute force dp fft math number theory *3500	0 / 0	10
	10308	P1909H Parallel Swaps Sort constructive algorithms data structures *3500	0 / 0	10
	10307	P1909I Short Permutation Problem combinatorics dp fft math *3500	0 / 0	10
	10280	P1916G Optimizations From Chelsu divide and conquer dp number theory trees *3500	0 / 0	10
	10270	P1919G Tree LGM constructive algorithms divide and conquer games trees *3500	0 / 2	10
	10269	P1919H Tree Diameter interactive trees *3500	0 / 0	10
	10335	P1924F Anti-Proxy Attendance constructive algorithms dp interactive ternary search *3500	0 / 0	10
	10424	P1930I Counting Is Fun combinatorics *3500	0 / 0	10
	10467	P1943F Minimum Hamming Distance dp *3500	0 / 0	10
	10616	P1967E2 Again Counting Arrays (Hard Version) combinatorics dp math *3500	0 / 0	10
	10549	P1975H 378QAQ and Core greedy strings *3500	0 / 0	10
	10548	P1975I Mind Bloom dp *3500	0 / 0	10
	10638	P1987G2 Spinning Round (Hard Version) divide and conquer dp trees *3500	0 / 0	10
	10637	P1987H Fumo Temple interactive *3500	0 / 0	10
	10719	P1994H Fortnite combinatorics constructive algorithms games greedy hashing interactive math number theory strings *3500	0 / 0	10

Pick a problem randomly based on the current filter.