sortings - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	26	P1641C Anonymity Is Important binary search brute force data structures dsu greedy sortings *2200	0 / 0	(None)
	13	P1646B Quality vs Quantity brute force constructive algorithms greedy sortings two pointers *800	0 / 0	(None)
	8	P1648A Weird Sum combinatorics data structures geometry math matrices sortings	0 / 0	(None)
	5215	P1650C Weight of the System of Nested Segments greedy hashing implementation sortings	0 / 0	(None)
	5213	P1650E Rescheduling the Exam binary search binary search binary search data structures greedy implementation math sortings	0 / 0	(None)
	7625	P1654A Maximum Cake Tastiness brute force greedy implementation sortings *800	0 / 0	(None)
	7623	P1654C Alice and the Cake data structures greedy implementation sortings *1400	0 / 0	(None)
	7620	P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	(None)
	7723	P1676B Equal Candies greedy math sortings *800	0 / 0	(None)
	7720	P1676E Eating Queries binary search greedy sortings *1100	0 / 0	(None)
	7719	P1676F Longest Strike data structures greedy implementation sortings two pointers *1300	0 / 0	(None)
	7716	P1676H2 Maximum Crossings (Hard Version) data structures divide and conquer sortings *1500	0 / 0	(None)
	7692	P1681C Double Sort implementation sortings *1200	0 / 0	(None)
	7687	P1682B AND Sorting bitmasks constructive algorithms sortings *1100	0 / 0	(None)
	7684	P1682E Unordered Swaps constructive algorithms dfs and similar graphs greedy math sortings trees *2700	0 / 0	(None)
	7683	P1682F MCMF? data structures flows graphs greedy sortings two pointers *2700	0 / 0	(None)
	7680	P1684C Column Swapping brute force constructive algorithms greedy implementation sortings *1400	0 / 0	(None)
	7679	P1684D Traps constructive algorithms greedy sortings *1700	0 / 0	(None)
	7674	P1685A Circular Local MiniMax constructive algorithms greedy sortings *1100	0 / 0	(None)
	7673	P1685B Linguistics greedy implementation sortings strings *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.