brute force - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1918	P1279B Verse For Santa binary search brute force implementation *1300	0 / 0	(None)
	1884	P1285C Fadi and LCM brute force math number theory *1400	0 / 0	(None)
	1883	P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	(None)
	1882	P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	(None)
	1878	P1286C1 Madhouse (Easy version) brute force constructive algorithms interactive math *2400	0 / 0	(None)
	1877	P1286C2 Madhouse (Hard version) brute force constructive algorithms hashing interactive math *2800	0 / 0	(None)
	1874	P1286F Harry The Potter brute force constructive algorithms dp fft implementation math *3100	0 / 0	(None)
	1872	P1287B Hyperset brute force data structures implementation *1500	0 / 0	(None)
	1871	P1288A Deadline binary search brute force math ternary search *1100	0 / 0	(None)
	1865	P1290A Mind Control brute force data structures implementation *1600	0 / 0	(None)
	1855	P1292B Aroma's Search brute force constructive algorithms geometry greedy implementation *1700	0 / 0	(None)
	1850	P1293A ConneR and the A.R.C binary search brute force implementation *1100	0 / 0	(None)
	1820	P1299A Anu Has a Function brute force greedy math *1500	0 / 0	(None)
	1802	P1302F Keep talking and nobody explodes – easy bitmasks brute force expression parsing	0 / 0	(None)
	1789	P1304B Longest Palindrome brute force constructive algorithms greedy implementation strings *1100	0 / 0	(None)
	1783	P1305A Kuroni and the Gifts brute force constructive algorithms greedy sortings *800	0 / 0	(None)
	1781	P1305C Kuroni and Impossible Calculation brute force combinatorics math number theory *1600	0 / 0	(None)
	1777	P1305G Kuroni and Antihype bitmasks brute force dp dsu graphs *3500	0 / 0	(None)
	1773	P1307C Cow and Message brute force dp math strings *1500	0 / 0	(None)
	1760	P1311C Perform the Combo brute force *1300	0 / 0	(None)

Pick a problem randomly based on the current filter.