Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5415	P1367D Task On The Board constructive algorithms greedy implementation sortings *1800	0 / 0	(None)
	5416	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	(None)
	5417	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	(None)
	5418	P1368A C+= brute force greedy implementation math *800	1 / 2	10
	5419	P1368B Codeforces Subsequences brute force constructive algorithms greedy math strings *1500	0 / 0	(None)
	5420	P1368D AND, OR and square sum bitmasks greedy math *1700	0 / 0	(None)
	5421	P1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	(None)
	5422	P1368F Lamps on a Circle games implementation interactive math *2600	0 / 0	(None)
	5423	P1368H1 Breadboard Capacity (easy version) dp flows greedy *3300	0 / 0	(None)
	5424	P1368H2 Breadboard Capacity (hard version) *3500	0 / 0	(None)
	5425	P1369B AccurateLee greedy implementation strings *1200	0 / 0	(None)
	5426	P1369C RationalLee greedy math sortings two pointers *1400	0 / 0	(None)
	5427	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	(None)
	5428	P1369E DeadLee data structures dfs and similar greedy implementation sortings *2400	0 / 0	(None)
	5429	P1370A Maximum GCD greedy implementation math number theory *800	0 / 0	(None)
	5430	P1370B GCD Compression constructive algorithms math number theory *1100	0 / 0	(None)
	5431	P1370C Number Game games math number theory *1400	0 / 0	(None)
	5432	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	(None)
	5433	P1370E Binary Subsequence Rotation binary search constructive algorithms data structures greedy *2100	0 / 0	(None)
	5434	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	(None)

Pick a problem randomly based on the current filter.