brute force - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5384	P1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	(None)
	5390	P1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	(None)
	5391	P1360H Binary Median binary search bitmasks brute force constructive algorithms *2100	0 / 0	(None)
	5402	P1364C Ehab and Prefix MEXs brute force constructive algorithms greedy *1600	0 / 0	(None)
	5406	P1365E Maximum Subsequence Value brute force constructive algorithms *1900	0 / 0	(None)
	5411	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	(None)
	5416	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	(None)
	5418	P1368A C+= brute force greedy implementation math *800	1 / 2	10
	5419	P1368B Codeforces Subsequences brute force constructive algorithms greedy math strings *1500	0 / 0	(None)
	5437	P1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	(None)
	5442	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	(None)
	5452	P1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	(None)
	5454	P1375D Replace by MEX brute force constructive algorithms sortings *1900	0 / 0	(None)
	5456	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(None)
	5458	P1379A Acacius and String brute force implementation strings *1500	0 / 0	(None)
	5459	P1379B Dubious Cyrpto binary search brute force math number theory *1500	0 / 0	(None)
	5460	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(None)
	5461	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	(None)
	5470	P1382A Common Subsequence brute force *800	0 / 0	(None)
	5473	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	(None)

Pick a problem randomly based on the current filter.