dp - Problem Set - 追梦算法网

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
6615	P208B Solitaire dfs and similar dp *1900	0 / 0	(None)
6614	P208C Police Station dp graphs shortest paths *1900	0 / 0	(None)
6611	P209A Multicolored Marbles dp math *1600	0 / 0	(None)
6606	P212C Cowboys combinatorics dp math *2100	0 / 0	(None)
6604	P212E IT Restaurants dfs and similar dp trees *1500	0 / 0	(None)
6602	P213B Numbers combinatorics dp *1900	0 / 0	(None)
6601	P213C Relay Race dp *2000	0 / 0	(None)
6592	P215E Periodical Numbers combinatorics dp number theory *2100	0 / 0	(None)
6584	P217C Formurosa divide and conquer dp expression parsing *2600	0 / 0	(None)
6577	P219C Color Stripe brute force dp greedy *1600	0 / 0	(None)
6576	P219D Choosing Capital for Treeland dfs and similar dp graphs trees *1700	0 / 0	(None)
6563	P222E Decoding Genome dp matrices *1900	0 / 0	(None)
6561	P223B Two Strings data structures dp strings *1900	0 / 0	(None)
6553	P225C Barcode dp matrices *1700	0 / 0	(None)
6541	P228C Fractal Detector dp hashing *2000	0 / 0	(None)
6535	P229D Towers dp greedy two pointers *2100	0 / 0	(None)
6534	P229E Gifts combinatorics dp math probabilities *2600	0 / 0	(None)
6527	P231E Cactus data structures dfs and similar dp graphs trees *2100	0 / 0	(None)
6525	P232B Table bitmasks combinatorics dp math *1900	0 / 0	(None)
6524	P232C Doe Graphs constructive algorithms divide and conquer dp graphs shortest paths *2600	0 / 0	(None)

Pick a problem randomly based on the current filter.

Categories