*2600 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	7726	P1700F Puzzle constructive algorithms dp greedy *2600	0 / 0	(None)
	7842	P1704F Colouring Game constructive algorithms dp games *2600	0 / 0	(None)
	8040	P1740F Conditional Mix combinatorics dp graphs math *2600	0 / 0	10
	8162	P1765G Guess the String constructive algorithms interactive probabilities *2600	0 / 0	10
	8097	P1773D Dominoes combinatorics flows graph matchings greedy *2600	0 / 0	10
	8093	P1773H Hot and Cold binary search interactive *2600	0 / 0	10
	8240	P1793E Velepin and Marketing binary search data structures dp greedy sortings two pointers *2600	0 / 0	10
	8239	P1793F Rebrending brute force data structures divide and conquer implementation *2600	0 / 0	10
	8395	P1815D XOR Counting bitmasks combinatorics dp math *2600	0 / 0	10
	8413	P1823F Random Walk dp graphs math probabilities trees *2600	0 / 0	10
	8487	P1827C Palindrome Partition binary search brute force data structures dp hashing strings *2600	0 / 0	10
	8555	P1835C Twin Clusters bitmasks brute force constructive algorithms math probabilities *2600	0 / 0	10
	8586	P1848E Vika and Stone Skipping brute force implementation math number theory *2600	0 / 0	10
	8603	P1858E2 Rollbacks (Hard Version) data structures interactive trees *2600	0 / 0	10
	8874	P1893D Colorful Constructive constructive algorithms data structures greedy *2600	0 / 0	10
	8865	P1896F Bracket Xoring constructive algorithms greedy implementation math *2600	0 / 0	10
	8856	P1898F Vova Escapes the Matrix brute force dfs and similar divide and conquer shortest paths *2600	0 / 0	10
	8924	P1919E Counting Prefixes combinatorics constructive algorithms dp math *2600	0 / 0	10
	9092	P1945H GCD is Greater brute force data structures math number theory *2600	0 / 0	10
	9212	P1957F1 Frequency Mismatch (Easy Version) binary search data structures divide and conquer hashing probabilities trees *2600	0 / 0	10

Pick a problem randomly based on the current filter.