Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3278	P1005D Polycarp and Div 3 dp greedy number theory *1500	0 / 0	(None)
	3277	P1005E1 Median on Segments (Permutations Edition) sortings *1800	0 / 0	(None)
	3276	P1005E2 Median on Segments (General Case Edition) sortings *2400	0 / 0	(None)
	3275	P1005F Berland and the Shortest Paths brute force dfs and similar graphs shortest paths *2100	0 / 0	(None)
	3274	P1006A Adjacent Replacements implementation *800	0 / 0	(None)
	3273	P1006B Polycarp's Practice greedy implementation sortings *1200	0 / 0	(None)
	3272	P1006C Three Parts of the Array binary search data structures two pointers *1200	0 / 0	(None)
	3271	P1006D Two Strings Swaps implementation *1700	0 / 0	(None)
	3270	P1006E Military Problem dfs and similar graphs trees *1600	0 / 0	(None)
	3269	P1006F Xor-Paths bitmasks brute force dp meet-in-the-middle *2100	0 / 0	(None)
	3268	P1007A Reorder the Array combinatorics data structures math sortings two pointers *1300	0 / 0	(None)
	3267	P1007B Pave the Parallelepiped bitmasks brute force combinatorics math number theory *2400	0 / 0	(None)
	3266	P1007C Guess two numbers binary search interactive *3000	0 / 0	(None)
	3265	P1007D Ants 2-sat data structures trees *3200	0 / 0	(None)
	3264	P1007E Mini Metro dp *3400	0 / 0	(None)
	3263	P1008A Romaji implementation strings *900	0 / 0	(None)
	3262	P1008B Turn the Rectangles greedy sortings *1000	0 / 0	(None)
	3261	P1009A Game Shopping implementation *800	0 / 0	(None)
	3260	P1009B Minimum Ternary String greedy implementation *1400	0 / 0	(None)
	3259	P1009C Annoying Present greedy math *1700	0 / 0	(None)

Pick a problem randomly based on the current filter.