Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2178	P1223A CME math *800	0 / 0	(None)
	2177	P1223B Strings Equalization strings *1000	0 / 0	(None)
	2176	P1223C Save the Nature binary search greedy *1600	0 / 0	(None)
	2175	P1223D Sequence Sorting dp greedy two pointers *2000	0 / 0	(None)
	2174	P1223E Paint the Tree dp sortings trees *2100	0 / 0	(None)
	2173	P1223F Stack Exterminable Arrays data structures divide and conquer dp hashing *2600	0 / 0	(None)
	2172	P1223G Wooden Raft binary search math number theory *3200	0 / 0	(None)
	2171	P1225A Forgetting Things math *900	0 / 0	(None)
	2170	P1225B1 TV Subscriptions (Easy Version) implementation *1000	0 / 0	(None)
	2169	P1225B2 TV Subscriptions (Hard Version) implementation two pointers *1300	0 / 0	(None)
	2168	P1225C p-binary bitmasks brute force math *1600	0 / 0	(None)
	2167	P1225D Power Products hashing math number theory *1800	0 / 0	(None)
	2166	P1225E Rock Is Push binary search dp *2200	0 / 0	(None)
	2165	P1225F Tree Factory constructive algorithms greedy trees *2500	0 / 0	(None)
	2164	P1225G To Make 1 bitmasks constructive algorithms dp greedy number theory *3100	0 / 0	(None)
	2163	P1227A Math Problem math *1100	0 / 0	(None)
	2162	P1227B Box constructive algorithms *1200	0 / 0	(None)
	2161	P1227C Messy constructive algorithms *1700	0 / 0	(None)
	2160	P1227D1 Optimal Subsequences (Easy Version) data structures greedy *1600	0 / 0	(None)
	2159	P1227D2 Optimal Subsequences (Hard Version) data structures greedy *1800	0 / 0	(None)

Pick a problem randomly based on the current filter.