brute force - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4920	P1210A Anadi and Domino brute force graphs *1700	0 / 0	(None)
	4923	P1210F1 Marek and Matching (easy version) brute force probabilities *3100	0 / 0	(None)
	4935	P1213D2 Equalizing by Division (hard version) brute force math sortings *1600	0 / 0	(None)
	4936	P1213E Two Small Strings brute force constructive algorithms *1900	0 / 0	(None)
	4938	P1214B Badges brute force math *1100	0 / 0	(None)
	4949	P1216E1 Numerical Sequence (easy version) binary search brute force math *1900	0 / 0	(None)
	4964	P1221A 2048 Game brute force greedy math *1000	0 / 0	(None)
	4984	P1228A Distinct Digits brute force implementation *800	0 / 0	(None)
	4995	P1236A Stones brute force greedy math *800	0 / 0	(None)
	4997	P1236D Alice and the Doll brute force data structures greedy implementation *2300	0 / 0	(None)
	5019	P1244B Rooms and Staircases brute force implementation *1000	0 / 0	(None)
	5020	P1244D Paint the Tree brute force constructive algorithms dp graphs implementation trees *1800	0 / 0	(None)
	5026	P1245F Daniel and Spring Cleaning bitmasks brute force combinatorics dp *2300	0 / 0	(None)
	5035	P1250B The Feast and the Bus brute force constructive algorithms greedy math *1800	0 / 0	(None)
	5038	P1250F Data Center brute force implementation *800	0 / 0	(None)
	5040	P1250I Show Must Go On binary search brute force greedy shortest paths *3100	0 / 0	(None)
	5073	P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	(None)
	5077	P1260E Tournament brute force dp greedy *2400	0 / 0	(None)
	5102	P1269B Modulo Equality brute force sortings *1500	0 / 0	(None)
	5109	P1271A Suits brute force greedy math *800	0 / 0	(None)

Pick a problem randomly based on the current filter.