Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6052	P1566B MIN-MEX Cut bitmasks constructive algorithms dp greedy *800	0 / 0	(None)
	6053	P1566D1 Seating Arrangements (easy version) data structures greedy sortings *1100	0 / 0	(None)
	6054	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	(None)
	6055	P1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	(None)
	6056	P1567A Domino Disaster implementation strings *800	0 / 0	(None)
	6057	P1567C Carrying Conundrum bitmasks combinatorics dp math *1600	0 / 0	(None)
	6058	P1567D Expression Evaluation Error constructive algorithms greedy implementation math *2000	0 / 0	(None)
	6059	P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	(None)
	6060	P1569B Chess Tournament constructive algorithms *1000	0 / 0	(None)
	6061	P1569C Jury Meeting combinatorics math *1500	0 / 0	(None)
	6062	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	(None)
	6063	P1571A Sequence of Comparisons special problem 800	0 / 0	(None)
	6064	P1571C Rhyme special problem implementation 1800	0 / 0	(None)
	6065	P1571E Fix the String special problem bitmasks dp greedy 1700	0 / 0	(None)
	6066	P1571G A Battle Against a Dragon special problem data structures dp 2500	0 / 0	(None)
	6067	P1571I Physical Examination special problem binary search data structures 3200	0 / 0	(None)
	6068	P1571J Two Railroads special problem 3000	0 / 0	(None)
	6069	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	(None)
	6070	P1572C Paint dp greedy *2700	0 / 0	(None)
	6071	P1572E Polygon binary search dp geometry *3000	0 / 0	(None)

Pick a problem randomly based on the current filter.