Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5319	P533D Landmarks data structures dp *3000	0 / 0	(None)
	5318	P533E Correcting Mistakes constructive algorithms dp greedy hashing strings two pointers *1800	0 / 0	(None)
	5317	P533F Encoding hashing string suffix structures strings *2400	0 / 0	(None)
	5316	P534A Exam constructive algorithms implementation math *1100	0 / 0	(None)
	5315	P534B Covered Path dp greedy math *1400	0 / 0	(None)
	5314	P534C Polycarpus' Dice math *1600	0 / 0	(None)
	5313	P534D Handshakes binary search constructive algorithms data structures greedy *1900	0 / 0	(None)
	5312	P534E Berland Local Positioning System constructive algorithms greedy hashing implementation *2400	0 / 0	(None)
	5311	P534F Simplified Nonogram bitmasks dp hashing meet-in-the-middle *2400	0 / 0	(None)
	5310	P535A Tavas and Nafas brute force implementation *1000	0 / 0	(None)
	5309	P535B Tavas and SaDDas bitmasks brute force combinatorics implementation *1100	0 / 0	(None)
	5308	P535C Tavas and Karafs binary search greedy math *1900	0 / 0	(None)
	5307	P535D Tavas and Malekas greedy hashing string suffix structures strings *1900	0 / 0	(None)
	5306	P535E Tavas and Pashmaks geometry math *2600	0 / 0	(None)
	5305	P536D Tavas in Kansas dp games *2900	0 / 0	(None)
	5304	P536E Tavas on the Path data structures divide and conquer trees *3100	0 / 0	(None)
	5303	P538A Cutting Banner brute force implementation *1400	0 / 0	(None)
	5302	P538B Quasi Binary constructive algorithms dp greedy implementation *1400	0 / 0	(None)
	5301	P538C Tourist's Notes binary search brute force greedy implementation math *1600	0 / 0	(None)
	5300	P538D Weird Chess brute force constructive algorithms implementation *1800	0 / 0	(None)

Pick a problem randomly based on the current filter.