Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6291	P1637D Yet Another Minimization Problem dp greedy math *1800	0 / 0	(None)
	6292	P1637E Best Pair binary search brute force implementation *2100	0 / 0	(None)
	6293	P1637G Birthday constructive algorithms greedy math *3000	0 / 0	(None)
	6294	P1637H Minimize Inversions Number data structures greedy math sortings *3500	0 / 0	(None)
	6295	P1638B Odd Swap Sort data structures math sortings *1100	5 / 15	8
	6296	P1638D Big Brush constructive algorithms data structures greedy implementation *2000	0 / 0	(None)
	6297	P1638F Two Posters brute force data structures greedy two pointers *3200	0 / 0	(None)
	6298	P1639B Treasure Hunt graphs interactive	0 / 0	(None)
	6299	P1639D Treasure Hunt graphs interactive	0 / 0	(None)
	6300	P1639E Treasure Hunt graphs interactive	0 / 0	(None)
	6301	P1639G Treasure Hunt graphs interactive	0 / 0	(None)
	6302	P1639I Treasure Hunt graphs interactive	0 / 0	(None)
	6303	P1639J Treasure Hunt graphs interactive	0 / 0	(None)
	6304	P1641A Great Sequence brute force greedy sortings *1200	0 / 1	10
	6305	P1641B Repetitions Decoding constructive algorithms implementation sortings *2000	0 / 0	(None)
	6306	P1641D Two Arrays bitmasks brute force combinatorics greedy hashing math two pointers *2700	0 / 0	(None)
	6307	P1641F Covering Circle geometry *3500	0 / 0	(None)
	6308	P1642B Power Walking greedy *900	2 / 12	10
	6309	P1644A Doors and Keys implementation *800	0 / 0	(None)
	6310	P1644C Increase Subarray Sums brute force dp greedy implementation *1400	0 / 0	(None)

Pick a problem randomly based on the current filter.