brute force - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2235	P1213D1 Equalizing by Division (easy version) brute force implementation *1500	0 / 0	(None)
	2234	P1213D2 Equalizing by Division (hard version) brute force math sortings *1600	0 / 0	(None)
	2233	P1213E Two Small Strings brute force constructive algorithms *1900	0 / 0	(None)
	2230	P1214A Optimal Currency Exchange brute force math *1400	0 / 0	(None)
	2229	P1214B Badges brute force math *1100	0 / 0	(None)
	2212	P1216E1 Numerical Sequence (easy version) binary search brute force math *1900	0 / 0	(None)
	2207	P1217C The Number Of Good Substrings binary search bitmasks brute force *1700	0 / 0	(None)
	2185	P1221A 2048 Game brute force greedy math *1000	0 / 0	(None)
	2179	P1221G Graph And Numbers bitmasks brute force combinatorics dp meet-in-the-middle *2900	0 / 0	(None)
	2168	P1225C p-binary bitmasks brute force math *1600	0 / 0	(None)
	2154	P1228A Distinct Digits brute force implementation *800	0 / 0	(None)
	2151	P1228D Complete Tripartite brute force constructive algorithms graphs hashing implementation *1900	0 / 0	(None)
	2148	P1230A Dawid and Bags of Candies brute force implementation *800	0 / 0	(None)
	2137	P1236A Stones brute force greedy math *800	0 / 0	(None)
	2134	P1236D Alice and the Doll brute force data structures greedy implementation *2300	0 / 0	(None)
	2099	P1244B Rooms and Staircases brute force implementation *1000	0 / 0	(None)
	2098	P1244C The Football Season brute force math number theory *2000	0 / 0	(None)
	2097	P1244D Paint the Tree brute force constructive algorithms dp graphs implementation trees *1800	0 / 0	(None)
	2088	P1245F Daniel and Spring Cleaning bitmasks brute force combinatorics dp *2300	0 / 0	(None)
	2084	P1248D1 The World Is Just a Programming Task (Easy Version) brute force dp greedy implementation *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.