sortings - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5354	P1353D Constructing the Array constructive algorithms data structures sortings *1600	0 / 0	(None)
	5359	P1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	(None)
	5361	P1355B Young Explorers dp greedy sortings *1200	0 / 0	(None)
	5363	P1355E Restorer Distance binary search greedy math sortings ternary search *2100	0 / 0	(None)
	5380	P1358B Maria Breaks the Self-isolation greedy sortings *1000	0 / 0	(None)
	5388	P1360C Similar Pairs constructive algorithms graph matchings greedy sortings *1100	0 / 0	(None)
	5392	P1361B Johnny and Grandmaster greedy implementation math sortings *1900	0 / 0	(None)
	5407	P1365F Swaps Again constructive algorithms implementation sortings *2100	0 / 0	(None)
	5415	P1367D Task On The Board constructive algorithms greedy implementation sortings *1800	0 / 0	(None)
	5426	P1369C RationalLee greedy math sortings two pointers *1400	0 / 0	(None)
	5428	P1369E DeadLee data structures dfs and similar greedy implementation sortings *2400	0 / 0	(None)
	5437	P1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	(None)
	5438	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	(None)
	5450	P1374D Zero Remainder Array math sortings two pointers *1400	0 / 0	(None)
	5451	P1374E1 Reading Books (easy version) data structures greedy sortings *1600	0 / 0	(None)
	5452	P1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	(None)
	5454	P1375D Replace by MEX brute force constructive algorithms sortings *1900	0 / 0	(None)
	5455	P1375E Inversion SwapSort constructive algorithms greedy sortings *2500	0 / 0	(None)
	5460	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(None)
	5461	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	(None)

Pick a problem randomly based on the current filter.