*2200 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	504	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	(None)
	498	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	(None)
	470	P1556E Equilibrium data structures dp greedy *2200	0 / 0	(None)
	463	P1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	(None)
	450	P1559E Mocha and Stars combinatorics dp fft math number theory *2200	0 / 0	(None)
	435	P1562D2 Two Hundred Twenty One (hard version) data structures math *2200	0 / 0	(None)
	419	P1567E Non-Decreasing Dilemma data structures divide and conquer math *2200	0 / 0	(None)
	381	P1575G GCD Festival math number theory *2200	0 / 0	(None)
	380	P1575H Holiday Wall Ornaments dp strings *2200	0 / 0	(None)
	377	P1575K Knitting Batik implementation math *2200	0 / 0	(None)
	353	P1579G Minimal Coverage dp *2200	0 / 0	(None)
	350	P1580C Train Maintenance brute force data structures implementation *2200	0 / 0	(None)
	332	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	(None)
	298	P1593G Changing Brackets constructive algorithms data structures dp greedy *2200	0 / 0	(None)
	236	P1607G Banquet Preparations 1 greedy *2200	0 / 0	(None)
	235	P1607H Banquet Preparations 2 greedy sortings two pointers *2200	0 / 0	(None)
	180	P1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	(None)
	171	P1616E Lexicographically Small Enough brute force data structures greedy strings *2200	0 / 0	(None)
	155	P1618G Trader Problem data structures dsu greedy sortings *2200	0 / 0	(None)
	126	P1622E Math Test bitmasks brute force greedy *2200	0 / 0	(None)

Pick a problem randomly based on the current filter.