Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5255	P1322B Present binary search bitmasks constructive algorithms data structures math sortings *2100	0 / 0	(None)
	5256	P1322D Reality Show bitmasks dp *2800	0 / 0	(None)
	5257	P1322F Assigning Fares dp trees *3500	0 / 0	(None)
	5258	P1323A Even Subset Sum Problem brute force dp greedy implementation *800	0 / 0	(None)
	5259	P1324A Yet Another Tetris Problem implementation number theory *900	0 / 0	(None)
	5260	P1324C Frog Jumps binary search data structures dfs and similar greedy implementation *1100	0 / 0	(None)
	5261	P1324E Sleeping Schedule dp implementation *1700	0 / 0	(None)
	5262	P1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	(None)
	5263	P1325B CopyCopyCopyCopyCopy greedy implementation *800	0 / 0	(None)
	5264	P1325C Ehab and Path-etic MEXs constructive algorithms dfs and similar greedy trees *1500	0 / 0	(None)
	5265	P1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	0 / 0	(None)
	5266	P1326A Bad Ugly Numbers constructive algorithms number theory *1000	0 / 0	(None)
	5267	P1326B Maximums implementation math *900	0 / 0	(None)
	5268	P1326D1 Prefix-Suffix Palindrome (Easy version) hashing string suffix structures strings *1500	0 / 0	(None)
	5269	P1326E Bombs data structures two pointers *2400	0 / 0	(None)
	5270	P1326F2 Wise Men (Hard Version) bitmasks dp math *3200	0 / 0	(None)
	5271	P1327A Sum of Odd Integers math *1100	0 / 0	(None)
	5272	P1327B Princesses and Princes brute force graphs greedy *1200	0 / 0	(None)
	5273	P1327D Infinite Path brute force dfs and similar graphs math number theory *2200	0 / 0	(None)
	5274	P1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.