Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5293	P1333C Eugene and an array binary search data structures implementation two pointers *1700	0 / 0	(None)
	5294	P1333E Road to 1600 brute force constructive algorithms *2400	0 / 0	(None)
	5295	P1334A Level Statistics implementation math *1200	0 / 0	(None)
	5296	P1334B Middle Class greedy sortings *1100	0 / 0	(None)
	5297	P1334D Minimum Euler Cycle constructive algorithms graphs greedy implementation *1800	0 / 0	(None)
	5298	P1334F Strange Function binary search data structures dp greedy *2500	0 / 0	(None)
	5299	P1335A Candies and Two Sisters math *800	0 / 0	(None)
	5300	P1335C Two Teams Composing binary search greedy implementation sortings *1100	0 / 0	(None)
	5301	P1335D Anti-Sudoku constructive algorithms implementation *1300	0 / 0	(None)
	5302	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	(None)
	5303	P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	(None)
	5304	P1336A Linova and Kingdom dfs and similar dp greedy sortings trees *1600	0 / 0	(None)
	5305	P1336B Xenia and Colorful Gems binary search greedy math sortings two pointers *1700	0 / 0	(None)
	5306	P1336D Yui and Mahjong Set constructive algorithms interactive *3200	0 / 0	(None)
	5307	P1336E2 Chiori and Doll Picking (hard version) bitmasks brute force combinatorics math *3500	0 / 0	(None)
	5308	P1337A Ichihime and Triangle constructive algorithms math *800	0 / 0	(None)
	5309	P1338A Powered Addition greedy math *1500	0 / 0	(None)
	5310	P1338C Perfect Triples bitmasks brute force constructive algorithms divide and conquer math *2200	0 / 0	(None)
	5311	P1338E JYPnation graphs *3500	0 / 0	(None)
	5312	P1339B Sorted Adjacent Differences constructive algorithms sortings *1200	0 / 0	(None)

Pick a problem randomly based on the current filter.