dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4762	P1163D Mysterious Code dp strings *2100	0 / 0	(None)
	4776	P1168C And Reachability bitmasks dp *2200	0 / 0	(None)
	4777	P1168D Anagram Paths dp implementation trees *3000	0 / 0	(None)
	4783	P1170I Good Subsets *special problem dp	0 / 0	(None)
	4785	P1172C1 Nauuo and Pictures (easy version) dp probabilities *2300	0 / 0	(None)
	4786	P1172C2 Nauuo and Pictures (hard version) dp probabilities *2600	0 / 0	(None)
	4792	P1174E Ehab and the Expected GCD Problem combinatorics dp math number theory *2500	0 / 0	(None)
	4796	P1175E Minimal Segment Cover data structures dfs and similar divide and conquer dp greedy implementation trees *2200	0 / 0	(None)
	4797	P1175G Yet Another Partiton Problem data structures divide and conquer dp geometry two pointers *3000	0 / 0	(None)
	4799	P1176C Lose it! dp greedy implementation *1300	0 / 0	(None)
	4801	P1176F Destroy it! dp implementation sortings *2100	0 / 0	(None)
	4804	P1178B WOW Factor dp strings *1300	0 / 0	(None)
	4806	P1178F1 Short Colorful Strip combinatorics dfs and similar dp *2200	0 / 0	(None)
	4810	P1179D Fedor Runs for President data structures dp trees *2700	0 / 0	(None)
	4811	P1180A Alex and a Rhombus dp implementation math *800	0 / 0	(None)
	4813	P1181C Flag brute force combinatorics dp implementation *1900	0 / 0	(None)
	4815	P1182A Filling Shapes dp math *1000	0 / 0	(None)
	4817	P1182D Complete Mirror constructive algorithms dfs and similar dp hashing implementation trees *2400	0 / 0	(None)
	4824	P1183H Subsequences (hard version) dp strings *1900	0 / 0	(None)
	4836	P1185G1 Playlist for Polycarp (easy version) bitmasks combinatorics dp *2100	0 / 0	(None)

Pick a problem randomly based on the current filter.