Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	358	P1579C Ticks greedy implementation *1500	0 / 0	(None)
	357	P1579D Productive Meeting constructive algorithms graphs greedy *1400	0 / 0	(None)
	356	P1579E1 Permutation Minimization by Deque constructive algorithms greedy math *1000	0 / 0	(None)
	355	P1579E2 Array Optimization by Deque data structures greedy *1700	0 / 0	(None)
	354	P1579F Array Stabilization (AND version) brute force graphs math number theory shortest paths *1700	0 / 0	(None)
	353	P1579G Minimal Coverage dp *2200	0 / 0	(None)
	352	P1580A Portal brute force data structures dp greedy implementation *1700	0 / 0	(None)
	351	P1580B Mathematics Curriculum brute force combinatorics dp trees *2600	0 / 0	(None)
	350	P1580C Train Maintenance brute force data structures implementation *2200	0 / 0	(None)
	349	P1580D Subsequence brute force divide and conquer dp greedy trees *2900	0 / 0	(None)
	348	P1580E Railway Construction brute force constructive algorithms data structures graphs shortest paths *3400	0 / 0	(None)
	347	P1580F Problems for Codeforces combinatorics fft math *3300	0 / 0	(None)
	346	P1581A CQXYM Count Permutations combinatorics math number theory *800	0 / 0	(None)
	345	P1581B Diameter of Graph constructive algorithms graphs greedy math *1200	0 / 0	(None)
	344	P1582A Luntik and Concerts math *800	0 / 0	(None)
	343	P1582B Luntik and Subsequences combinatorics math *900	0 / 0	(None)
	342	P1582C Grandma Capa Knits a Scarf brute force data structures greedy strings two pointers *1200	0 / 0	(None)
	341	P1582D Vupsen, Pupsen and 0 constructive algorithms math *1600	0 / 0	(None)
	340	P1582E Pchelyonok and Segments binary search data structures dp greedy math *2000	0 / 0	(None)
	339	P1582F1 Korney Korneevich and XOR (easy version) bitmasks dp greedy *1800	0 / 0	(None)

Pick a problem randomly based on the current filter.