Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	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)
	5435	P1371A Magical Sticks math *800	0 / 0	(None)
	5436	P1371C A Cookie for You greedy implementation math *1300	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)
	5439	P1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	(None)
	5440	P1372A Omkar and Completion constructive algorithms implementation *800	0 / 0	(None)
	5441	P1372C Omkar and Baseball constructive algorithms math *1500	0 / 0	(None)
	5442	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	(None)
	5443	P1372F Omkar and Modes binary search divide and conquer interactive *2700	0 / 0	(None)
	5444	P1373A Donut Shops greedy implementation math *1000	0 / 0	(None)
	5445	P1373C Pluses and Minuses math *1300	0 / 0	(None)
	5446	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	(None)
	5447	P1373F Network Coverage binary search constructive algorithms data structures greedy *2400	0 / 0	(None)
	5448	P1374A Required Remainder math *800	0 / 0	(None)
	5449	P1374C Move Brackets greedy strings *1000	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)

Pick a problem randomly based on the current filter.