Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1718	P1324A Yet Another Tetris Problem implementation number theory *900	0 / 0	(None)
	1717	P1324B Yet Another Palindrome Problem brute force strings *1100	0 / 0	(None)
	1716	P1324C Frog Jumps binary search data structures dfs and similar greedy implementation *1100	0 / 0	(None)
	1715	P1324D Pair of Topics binary search data structures sortings two pointers *1400	0 / 0	(None)
	1714	P1324E Sleeping Schedule dp implementation *1700	0 / 0	(None)
	1713	P1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	(None)
	1712	P1325A EhAb AnD gCd constructive algorithms greedy number theory *800	0 / 0	(None)
	1711	P1325B CopyCopyCopyCopyCopy greedy implementation *800	0 / 0	(None)
	1710	P1325C Ehab and Path-etic MEXs constructive algorithms dfs and similar greedy trees *1500	0 / 0	(None)
	1709	P1325D Ehab the Xorcist bitmasks constructive algorithms greedy number theory *1700	0 / 0	(None)
	1708	P1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	0 / 0	(None)
	1707	P1325F Ehab's Last Theorem constructive algorithms dfs and similar graphs greedy *2500	0 / 0	(None)
	1706	P1326A Bad Ugly Numbers constructive algorithms number theory *1000	0 / 0	(None)
	1705	P1326B Maximums implementation math *900	0 / 0	(None)
	1704	P1326C Permutation Partitions combinatorics greedy math *1300	0 / 0	(None)
	1703	P1326D1 Prefix-Suffix Palindrome (Easy version) hashing string suffix structures strings *1500	0 / 0	(None)
	1702	P1326D2 Prefix-Suffix Palindrome (Hard version) binary search greedy hashing string suffix structures strings *1800	0 / 0	(None)
	1701	P1326E Bombs data structures two pointers *2400	0 / 0	(None)
	1700	P1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	(None)
	1699	P1326F2 Wise Men (Hard Version) bitmasks dp math *3200	0 / 0	(None)

Pick a problem randomly based on the current filter.