dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9114	P1941C Rudolf and the Ugly String dp greedy strings *900	0 / 0	3
	9113	P1941D Rudolf and the Ball Game dfs and similar dp implementation *1200	0 / 0	4
	9112	P1941E Rudolf and k Bridges binary search data structures dp two pointers *1600	0 / 0	5
	9106	P1943D1 Counting Is Fun (Easy Version) brute force combinatorics dp math *2400	0 / 0	9
	9105	P1943D2 Counting Is Fun (Hard Version) combinatorics dp *2800	0 / 0	10
	9102	P1943F Minimum Hamming Distance dp *3500	0 / 0	10
	9096	P1945D Seraphim the Owl dp greedy *1300	0 / 0	4
	9090	P1946B Maximum Sum dp greedy math *1100	0 / 0	3
	9089	P1946C Tree Cutting binary search dp greedy implementation trees *1600	0 / 0	5
	9087	P1946E Girl Permutation combinatorics dp math number theory *2200	0 / 0	8
	9086	P1946F Nobody is needed brute force data structures dp math *2500	0 / 0	9
	9084	P1948B Array Fix brute force dp greedy implementation *1100	0 / 0	3
	9083	P1948C Arrow Path brute force constructive algorithms dfs and similar dp graphs shortest paths *1300	0 / 0	4
	9078	P1949A Grove brute force dfs and similar dp geometry probabilities	0 / 0	(None)
	9250	P1951H Thanos Snap binary search dp games greedy trees *3200	0 / 0	10
	9235	P1954D Colored Balls combinatorics dp math sortings *1800	0 / 0	6
	9233	P1954F Unique Strings combinatorics dp math *3100	0 / 0	10
	9227	P1955F Unfair Game dp games greedy math schedules *1800	0 / 0	6
	9226	P1955G GCD on a grid brute force dfs and similar dp implementation math number theory *1900	0 / 0	6
	9225	P1955H The Most Reckless Defense bitmasks brute force constructive algorithms dp flows graph matchings shortest paths *2300	0 / 0	8

Pick a problem randomly based on the current filter.