Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9200	P1967B2 Reverse Card (Hard Version) brute force math number theory *2200	0 / 0	8
	9199	P1967C Fenwick Tree bitmasks brute force combinatorics data structures dp math trees *2300	0 / 0	8
	9198	P1967D Long Way to be Non-decreasing binary search dfs and similar graphs implementation shortest paths two pointers *2800	0 / 0	10
	9197	P1967E1 Again Counting Arrays (Easy Version) combinatorics dp fft math *3100	0 / 0	10
	9196	P1967E2 Again Counting Arrays (Hard Version) combinatorics dp math *3500	0 / 0	10
	9195	P1967F Next and Prev brute force data structures implementation *3200	0 / 0	10
	9194	P1968A Maximize? brute force math number theory *800	0 / 0	3
	9193	P1968B Prefiquence greedy two pointers *800	0 / 0	3
	9192	P1968C Assembly via Remainders constructive algorithms number theory *1000	0 / 0	3
	9191	P1968D Permutation Game brute force dfs and similar games graphs greedy math *1300	0 / 0	4
	9190	P1968E Cells Arrangement constructive algorithms *1600	0 / 0	5
	9189	P1968F Equal XOR Segments binary search data structures *1800	0 / 0	6
	9188	P1968G1 Division + LCP (easy version) binary search data structures dp hashing string suffix structures strings *1900	0 / 0	6
	9187	P1968G2 Division + LCP (hard version) binary search brute force data structures dp hashing math string suffix structures strings *2200	0 / 0	8
	9186	P1969A Two Friends constructive algorithms implementation math *800	0 / 0	3
	9185	P1969B Shifts and Sorting constructive algorithms greedy *1000	0 / 0	3
	9184	P1969C Minimizing the Sum dp implementation *1700	0 / 0	5
	9183	P1969D Shop Game data structures greedy math sortings *1900	0 / 0	6
	9182	P1969E Unique Array binary search data structures divide and conquer dp greedy *2400	0 / 0	9
	9181	P1969F Card Pairing dp greedy hashing implementation *3000	0 / 0	10

Pick a problem randomly based on the current filter.