*2300 - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	908	P1712E1 LCM Sum (easy version) binary search brute force combinatorics math number theory two pointers *2300	0 / 0	8
	820	P1728E Red-Black Pepper brute force data structures greedy math number theory *2300	0 / 0	8
	754	P1738E Balance Addicts combinatorics dp math two pointers *2300	0 / 0	8
	693	P1743F Intersection and Union data structures dp matrices probabilities *2300	0 / 0	8
	650	P1748E Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees *2300	0 / 0	8
	482	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	468	P1768E Partial Sorting combinatorics math number theory *2300	0 / 0	8
	339	P1780F Three Chairs bitmasks brute force combinatorics data structures dp number theory sortings *2300	0 / 0	8
	330	P1781E Rectangle Shrinking binary search brute force data structures greedy implementation two pointers *2300	0 / 0	8
	316	P1783E Game of the Year brute force data structures math number theory *2300	0 / 0	8
	269	P1790G Tokens on Graph constructive algorithms dfs and similar graphs shortest paths *2300	0 / 0	8
	204	P1797E Li Hua and Array brute force data structures dsu math number theory two pointers *2300	0 / 0	8
	195	P1798E Multitest Generator brute force dp *2300	0 / 0	8
	184	P1799E City Union constructive algorithms dfs and similar dsu geometry greedy implementation math *2300	0 / 0	8
	137	P1805E There Should Be a Lot of Maximums brute force data structures dfs and similar dp trees two pointers *2300	0 / 0	8
	51	P1814E Chain Chips data structures dp matrices *2300	0 / 0	8
	9941	P1834E MEX of LCM binary search data structures implementation math number theory *2300	0 / 0	8
	9927	P1842E Tenzing and Triangle data structures dp geometry greedy math *2300	0 / 0	8
	9916	P1843F2 Omsk Metro (hard version) data structures dfs and similar divide and conquer dp math trees *2300	0 / 0	8
	10126	P1870E Another MEX Problem bitmasks brute force dp shortest paths *2300	0 / 0	8
	10173	P1895E Infinite Card Game binary search brute force data structures dfs and similar dp dsu games graphs greedy sortings two pointers *2300	0 / 0	8
	10225	P1914G2 Light Bulbs (Hard Version) combinatorics data structures dfs and similar dp graphs hashing *2300	0 / 0	8
	10282	P1916E Happy Life in University data structures dfs and similar greedy trees *2300	0 / 0	8
	10221	P1917D Yet Another Inversions Problem combinatorics data structures divide and conquer math *2300	0 / 0	8
	10272	P1919F1 Wine Factory (Easy Version) data structures greedy *2300	0 / 0	8
	10435	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
	10434	P1929F Sasha and the Wedding Binary Search Tree brute force combinatorics data structures dfs and similar math trees *2300	0 / 0	8
	10410	P1932G Moving Platforms graphs math number theory shortest paths *2300	0 / 0	8
	10403	P1933G Turtle Magic: Royal Turtle Shell Pattern bitmasks brute force combinatorics constructive algorithms dfs and similar math *2300	0 / 0	8
	10472	P1943C Tree Compass constructive algorithms dfs and similar greedy trees *2300	0 / 0	8
	10628	P1965C Folding Strip constructive algorithms greedy strings *2300	0 / 0	8
	10619	P1967C Fenwick Tree bitmasks brute force combinatorics data structures dp math trees *2300	0 / 0	8
	10595	P1970B3 Exact Neighbours (Hard) constructive algorithms *2300	0 / 0	8
	10585	P1970F1 Playing Quidditch (Easy) implementation *2300	0 / 0	8
	10584	P1970F2 Playing Quidditch (Medium) implementation *2300	0 / 0	8
	10583	P1970F3 Playing Quidditch (Hard) implementation *2300	0 / 0	8
	10538	P1977D XORificator bitmasks brute force greedy hashing *2300	0 / 0	8
	10679	P1980G Yasya and the Mysterious Tree bitmasks data structures dfs and similar graphs greedy strings trees *2300	0 / 0	8
	10674	P1982E Number of k-good subarrays bitmasks brute force combinatorics divide and conquer dp math meet-in-the-middle *2300	0 / 0	8
	10751	P1988E Range Minimum Sum binary search brute force data structures divide and conquer implementation *2300	0 / 0	8
	10632	P1989E Distance to Different combinatorics dp math *2300	0 / 0	8
	10714	P1995D Cases bitmasks brute force dp strings *2300	0 / 0	8

Pick a problem randomly based on the current filter.