sortings - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1324	P1393C Pinkie Pie Eats Patty-cakes constructive algorithms greedy math sortings *1700	0 / 0	(None)
	1320	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	(None)
	1317	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	(None)
	1309	P1396D Rainbow Rectangles data structures sortings two pointers *3300	0 / 0	(None)
	1306	P1397B Power Sequence brute force math number theory sortings *1500	0 / 0	(None)
	1304	P1398B Substring Removal Game games greedy sortings *800	0 / 0	(None)
	1302	P1398D Colored Rectangles dp greedy sortings *1800	0 / 0	(None)
	1301	P1398E Two Types of Spells binary search data structures greedy implementation math sortings *2200	0 / 0	(None)
	1298	P1399A Remove Smallest greedy sortings *800	0 / 0	(None)
	1293	P1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	(None)
	1292	P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	(None)
	1282	P1401C Mere Array constructive algorithms math number theory sortings *1300	0 / 0	(None)
	1281	P1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	(None)
	1280	P1401E Divide Square data structures geometry implementation sortings *2400	0 / 0	(None)
	1278	P1402A Fancy Fence special problem data structures dsu implementation math sortings 1800	0 / 0	(None)
	1277	P1402B Roads special problem geometry sortings 2900	0 / 0	(None)
	1275	P1403A The Potion of Great Power special problem 2-sat binary search data structures graphs interactive sortings two pointers 2400	0 / 0	(None)
	1264	P1406B Maximum Product brute force dp greedy implementation sortings *1200	0 / 0	(None)
	1252	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	(None)
	1251	P1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	(None)

Pick a problem randomly based on the current filter.