*2200 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6877	P153C Caesar Cipher special problem 2200	0 / 0	(None)
	6816	P165E Compatible Numbers bitmasks brute force dfs and similar dp *2200	0 / 0	(None)
	6789	P172E BHTML+BCSS special problem dfs and similar expression parsing 2200	0 / 0	(None)
	6739	P178F2 Representative Sampling dp sortings strings *2200	0 / 0	(None)
	6729	P182A Battlefield geometry graphs implementation shortest paths *2200	0 / 0	(None)
	6722	P183C Cyclic Coloring dfs and similar *2200	0 / 0	(None)
	6688	P191E Thwarting Demonstrations binary search data structures trees *2200	0 / 0	(None)
	6671	P196C Paint Tree constructive algorithms divide and conquer geometry sortings trees *2200	0 / 0	(None)
	6628	P207C2 Game with Two Trees *2200	0 / 0	(None)
	6575	P219E Parking Lot data structures *2200	0 / 0	(None)
	6552	P225D Snake bitmasks dfs and similar graphs implementation *2200	0 / 0	(None)
	6476	P243C Colorado Potato Beetle dfs and similar implementation *2200	0 / 0	(None)
	6465	P245G Suggested Friends brute force graphs *2200	0 / 0	(None)
	6435	P253E Printer binary search data structures implementation sortings *2200	0 / 0	(None)
	6425	P255E Furlo and Rublo and Game games implementation math *2200	0 / 0	(None)
	6418	P257E Greedy Elevator data structures implementation *2200	0 / 0	(None)
	6362	P271E Three Horses constructive algorithms math number theory *2200	0 / 0	(None)
	6357	P272E Dima and Horses combinatorics constructive algorithms graphs *2200	0 / 0	(None)
	6351	P274D Lovely Matrix dfs and similar graphs greedy sortings *2200	0 / 0	(None)
	6332	P279D The Minimum Number of Variables bitmasks dp *2200	0 / 0	(None)

Pick a problem randomly based on the current filter.