Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1298	P1399A Remove Smallest greedy sortings *800	0 / 0	(None)
	1297	P1399B Gifts Fixing greedy *800	0 / 0	(None)
	1296	P1399C Boats Competition brute force greedy two pointers *1200	0 / 0	(None)
	1295	P1399D Binary String To Subsequences constructive algorithms data structures greedy implementation *1500	0 / 0	(None)
	1294	P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	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)
	1291	P1400A String Similarity constructive algorithms strings *800	0 / 0	(None)
	1290	P1400B RPG Protagonist brute force greedy math *1700	0 / 0	(None)
	1289	P1400C Binary String Reconstruction 2-sat brute force constructive algorithms greedy *1500	0 / 0	(None)
	1288	P1400D Zigzags brute force combinatorics data structures math two pointers *1900	0 / 0	(None)
	1287	P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	(None)
	1286	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	(None)
	1285	P1400G Mercenaries bitmasks brute force combinatorics dp dsu math two pointers *2600	0 / 0	(None)
	1284	P1401A Distance and Axis constructive algorithms math *900	0 / 0	(None)
	1283	P1401B Ternary Sequence constructive algorithms greedy math *1100	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)
	1279	P1401F Reverse and Swap binary search bitmasks data structures *2400	0 / 0	(None)

Pick a problem randomly based on the current filter.