*1700 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6004	P1550C Manhattan Subarrays brute force geometry greedy implementation *1700	0 / 0	(None)
	6009	P1551D1 Domino (easy version) constructive algorithms math *1700	0 / 0	(None)
	6033	P1557C Moamen and XOR bitmasks combinatorics dp math matrices *1700	0 / 0	(None)
	6049	P1562D1 Two Hundred Twenty One (easy version) data structures dp math *1700	0 / 0	(None)
	6065	P1571E Fix the String special problem bitmasks dp greedy 1700	0 / 0	(None)
	6098	P1579E2 Array Optimization by Deque data structures greedy *1700	0 / 0	(None)
	6099	P1579F Array Stabilization (AND version) brute force graphs math number theory shortest paths *1700	0 / 0	(None)
	6100	P1580A Portal brute force data structures dp greedy implementation *1700	0 / 0	(None)
	6113	P1583C Omkar and Determination data structures dp *1700	0 / 0	(None)
	6136	P1594D The Number of Imposters constructive algorithms dfs and similar dp dsu graphs *1700	0 / 0	(None)
	6225	P1618E Singers' Tour constructive algorithms math *1700	0 / 0	(None)
	6230	P1619E MEX and Increments constructive algorithms data structures dp greedy implementation math sortings *1700	0 / 0	(None)
	6238	P1621C Hidden Permutations dfs and similar interactive math *1700	0 / 0	(None)
	6311	P1644D Cross Coloring data structures implementation math *1700	0 / 0	(None)
	6433	P6433 Riverside Curio data structures dp greedy *1700	0 / 0	(None)
	6444	P6444 Resource Distribution binary search implementation sortings *1700	0 / 0	(None)
	6447	P6447 Riverside Curio data structures dp greedy *1700	0 / 0	(None)

Pick a problem randomly based on the current filter.