implementation - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	473	P1556B Take Your Places! implementation *1300	0 / 0	(None)
	472	P1556C Compressed Bracket Sequence brute force implementation *1800	0 / 0	(None)
	449	P1560A Dislike of Threes implementation *800	0 / 0	(None)
	447	P1560C Infinity Table implementation math *800	0 / 0	(None)
	445	P1560E Polycarp and String Transformation binary search implementation sortings strings *1800	0 / 0	(None)
	442	P1561A Simply Strange Sort brute force implementation sortings *800	0 / 0	(None)
	438	P1562B Scenes From a Memory brute force constructive algorithms implementation math number theory *1000	0 / 0	(None)
	428	P1566D2 Seating Arrangements (hard version) data structures greedy implementation sortings two pointers *1600	0 / 0	(None)
	426	P1566F Points Movement data structures dp greedy implementation sortings *2600	0 / 0	(None)
	425	P1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	(None)
	423	P1567A Domino Disaster implementation strings *800	0 / 0	(None)
	420	P1567D Expression Evaluation Error constructive algorithms greedy implementation math *2000	0 / 0	(None)
	418	P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	(None)
	417	P1569A Balanced Substring implementation *800	0 / 0	(None)
	414	P1569D Inconvenient Pairs binary search data structures implementation sortings two pointers *1900	0 / 0	(None)
	413	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	(None)
	409	P1571C Rhyme special problem implementation 1800	0 / 0	(None)
	408	P1571D Sweepstake special problem brute force constructive algorithms implementation math 1800	0 / 0	(None)
	401	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	(None)
	390	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.