data structures - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	222	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	(None)
	221	P1609G A Stroll Around the Matrix data structures greedy math *3000	0 / 0	(None)
	213	P1610G AmShZ Wins a Bet data structures greedy hashing *3300	0 / 0	(None)
	212	P1610H Squid Game data structures dfs and similar greedy trees *3100	0 / 0	(None)
	204	P1611F ATM and Students binary search data structures two pointers *1800	0 / 0	(None)
	203	P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	(None)
	184	P1614E Divan and a Cottage binary search data structures *2600	0 / 0	(None)
	179	P1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	(None)
	176	P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	(None)
	171	P1616E Lexicographically Small Enough brute force data structures greedy strings *2200	0 / 0	(None)
	168	P1616H Keep XOR Low bitmasks combinatorics data structures divide and conquer dp math *3000	0 / 0	(None)
	155	P1618G Trader Problem data structures dsu greedy sortings *2200	0 / 0	(None)
	150	P1619E MEX and Increments constructive algorithms data structures dp greedy implementation math sortings *1700	0 / 0	(None)
	147	P1619H Permutation and Queries brute force data structures divide and conquer two pointers *2400	0 / 0	(None)
	142	P1620E Replace the Numbers constructive algorithms data structures dsu implementation *1900	0 / 0	(None)
	138	P1621B Integers Shop data structures greedy implementation *1500	0 / 0	(None)
	135	P1621E New School binary search data structures dp greedy implementation sortings *2300	0 / 0	(None)
	134	P1621F Strange Instructions data structures greedy implementation *2700	0 / 0	(None)
	133	P1621G Weighted Increasing Subsequences data structures dp math *3200	0 / 0	(None)
	131	P1621I Two Sequences data structures hashing string suffix structures *3500	0 / 0	(None)

Pick a problem randomly based on the current filter.