brute force - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1407	P1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	(None)
	1403	P1375D Replace by MEX brute force constructive algorithms sortings *1900	0 / 0	(None)
	1400	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(None)
	1397	P1379A Acacius and String brute force implementation strings *1500	0 / 0	(None)
	1396	P1379B Dubious Cyrpto binary search brute force math number theory *1500	0 / 0	(None)
	1395	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(None)
	1394	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	(None)
	1390	P1380A Three Indices brute force data structures *900	0 / 0	(None)
	1388	P1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	(None)
	1377	P1382A Common Subsequence brute force *800	0 / 0	(None)
	1372	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	(None)
	1368	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	(None)
	1363	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	(None)
	1352	P1388A Captain Flint and Crew Recruitment brute force greedy math number theory *800	0 / 0	(None)
	1346	P1389B Array Walk brute force dp greedy *1600	0 / 0	(None)
	1345	P1389C Good String brute force dp greedy two pointers *1500	0 / 0	(None)
	1344	P1389D Segment Intersections brute force greedy implementation math *2100	0 / 0	(None)
	1339	P1391B Fix You brute force greedy implementation *800	0 / 0	(None)
	1337	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	(None)
	1319	P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	(None)

Pick a problem randomly based on the current filter.