Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3331	P576B Invariance of Tree constructive algorithms dfs and similar greedy trees *2100	0 / 0	(None)
	3332	P576C Points on Plane constructive algorithms divide and conquer geometry greedy sortings *2100	0 / 0	(None)
	3333	P576D Flights for Regular Customers dp matrices *2700	0 / 0	(None)
	3334	P577A Multiplication Table implementation number theory *1000	0 / 0	(None)
	3335	P578A A Problem about Polyline geometry math *1700	0 / 0	(None)
	3336	P578C Weakness and Poorness ternary search *2000	0 / 0	(None)
	3337	P578D LCS Again dp greedy *2700	0 / 0	(None)
	3338	P578E Walking! constructive algorithms greedy *2700	0 / 0	(None)
	3339	P578F Mirror Box matrices trees *3200	0 / 0	(None)
	3340	P579A Raising Bacteria bitmasks *1000	0 / 0	(None)
	3341	P580A Kefa and First Steps brute force dp implementation *900	0 / 0	(None)
	3342	P580C Kefa and Park dfs and similar graphs trees *1500	0 / 0	(None)
	3343	P580D Kefa and Dishes bitmasks dp *1800	0 / 0	(None)
	3344	P581A Vasya the Hipster implementation math *800	0 / 0	(None)
	3345	P581C Developing Skills implementation math sortings *1400	0 / 0	(None)
	3346	P581E Kojiro and Furrari dp greedy *2800	0 / 0	(None)
	3347	P581F Zublicanes and Mumocrates dp trees two pointers *2400	0 / 0	(None)
	3348	P582A GCD Table constructive algorithms greedy number theory *1700	0 / 0	(None)
	3349	P582C Superior Periodic Subarrays number theory *2400	0 / 0	(None)
	3350	P582E Boolean Function bitmasks dp expression parsing *3000	0 / 0	(None)

Pick a problem randomly based on the current filter.