*2900 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	7754	P1698G Long Binary String bitmasks math meet-in-the-middle number theory *2900	0 / 0	(None)
	7820	P1713F Lost Array bitmasks combinatorics constructive algorithms dp math *2900	0 / 0	(None)
	7963	P1735F Pebbles and Beads data structures geometry *2900	0 / 0	10
	8054	P1747E List Generation combinatorics dp math *2900	0 / 0	10
	8159	P1765J Hero to Zero graph matchings math *2900	0 / 0	10
	8091	P1773J Jumbled Trees constructive algorithms math *2900	0 / 0	10
	8180	P1792F2 Graph Coloring (hard version) brute force combinatorics divide and conquer dp fft graphs *2900	0 / 0	10
	8269	P1796F Strange Triples brute force math number theory *2900	0 / 0	10
	8341	P1810H Last Number math *2900	0 / 0	10
	8554	P1835D Doctor's Brown Hypothesis dfs and similar graphs math number theory *2900	0 / 0	10
	8743	P1870F Lazy Numbers binary search math *2900	0 / 0	10
	8837	P1901F Landscaping binary search geometry two pointers *2900	0 / 0	10
	8890	P1910J Two Colors special problem 2900	0 / 0	10
	8938	P1916F Group Division constructive algorithms dfs and similar graphs greedy *2900	0 / 0	10
	9042	P1928F Digital Patterns combinatorics data structures implementation math *2900	0 / 0	10
	9104	P1943E1 MEX Game 2 (Easy Version) binary search brute force greedy *2900	0 / 0	10
	9207	P1965D Missing Subarray Sum constructive algorithms *2900	0 / 0	10
	9368	P1979F Kostyanych's Theorem brute force constructive algorithms graphs interactive *2900	0 / 0	10
	9321	P1987G1 Spinning Round (Easy Version) divide and conquer dp trees *2900	0 / 0	10

Pick a problem randomly based on the current filter.