*3200 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	947	P1470E Strange Permutation binary search combinatorics data structures dp graphs implementation two pointers *3200	0 / 0	(None)
	880	P1482G Vabank binary search interactive *3200	0 / 0	(None)
	811	P1495E Qingshan and Daniel brute force data structures greedy implementation *3200	0 / 0	(None)
	739	P1510H Hard Optimization dp *3200	0 / 0	(None)
	691	P1517F Reunion combinatorics dp trees *3200	0 / 0	(None)
	683	P1519F Chests and Keys bitmasks brute force dfs and similar dp flows *3200	0 / 0	(None)
	663	P1523G Try Booking data structures divide and conquer *3200	0 / 0	(None)
	557	P1540D Inverse Inversions binary search brute force data structures *3200	0 / 0	(None)
	424	P1566H Xor-quiz constructive algorithms dp interactive math number theory *3200	0 / 0	(None)
	403	P1571I Physical Examination special problem binary search data structures 3200	0 / 0	(None)
	370	P1578D Dragon Curve *3200	0 / 0	(None)
	322	P1584G Eligible Segments geometry *3200	0 / 0	(None)
	284	P1598G The Sum of Good Numbers hashing math string suffix structures strings *3200	0 / 0	(None)
	280	P1599D Bubble Popping *3200	0 / 0	(None)
	279	P1599E Two Arrays data structures matrices *3200	0 / 0	(None)
	258	P1603E A Perfect Problem combinatorics dp math *3200	0 / 0	(None)
	229	P1608F MEX counting combinatorics dp implementation *3200	0 / 0	(None)
	133	P1621G Weighted Increasing Subsequences data structures dp math *3200	0 / 0	(None)
	40	P1638F Two Posters brute force data structures greedy two pointers *3200	0 / 0	(None)
	7840	P1704H1 Game of AI (easy version) combinatorics constructive algorithms dp fft math *3200	0 / 0	(None)

Pick a problem randomly based on the current filter.