*2500 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3842	P883D Packmen Strike Back binary search dp math *2500	0 / 0	(None)
	3834	P883L Berland.Taxi data structures *2500	0 / 0	(None)
	3828	P884E Binary Matrix dsu *2500	0 / 0	(None)
	3827	P884F Anti-Palindromize flows graphs greedy *2500	0 / 0	(None)
	3815	P887F Row of Models greedy sortings *2500	0 / 0	(None)
	3809	P888F Connecting Vertices dp graphs *2500	0 / 0	(None)
	3734	P908E New Year and Entity Enumeration bitmasks combinatorics dp math *2500	0 / 0	(None)
	3725	P909F AND-permutations constructive algorithms *2500	0 / 0	(None)
	3715	P911G Mass Change Queries data structures *2500	0 / 0	(None)
	3712	P912C Perun, Ult! brute force greedy sortings *2500	0 / 0	(None)
	3638	P923D Picking Strings constructive algorithms implementation strings *2500	0 / 0	(None)
	3632	P924D Contact ATC *2500	0 / 0	(None)
	3601	P930D Game with Tokens data structures games implementation *2500	0 / 0	(None)
	3545	P946G Almost Increasing Array data structures dp *2500	0 / 0	(None)
	3521	P954H Path Counting combinatorics dp *2500	0 / 0	(None)
	3505	P958C3 Encryption (hard) data structures dp *2500	0 / 0	(None)
	3465	P963D Frequency of String hashing string suffix structures strings *2500	0 / 0	(None)
	3446	P976D Degree Set constructive algorithms graphs implementation *2500	0 / 0	(None)
	3444	P976F Minimal k-covering flows graphs *2500	0 / 0	(None)
	3414	P981F Round Marriage binary search graph matchings greedy *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.