brute force - 题库 - HydroOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	900	P1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	6
	894	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	7
	887	P1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	8
	878	P1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	9
	875	P1375D Replace by MEX brute force constructive algorithms sortings *1900	0 / 0	6
	871	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	10
	868	P1379A Acacius and String brute force implementation strings *1500	0 / 0	5
	867	P1379B Dubious Cyrpto binary search brute force math number theory *1500	0 / 0	5
	866	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	7
	864	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	8
	861	P1380A Three Indices brute force data structures *900	0 / 0	3
	859	P1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	4
	848	P1382A Common Subsequence brute force *800	1 / 1	3
	844	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	3 / 4	10
	839	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	6
	834	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	1 / 1	5
	823	P1388A Captain Flint and Crew Recruitment brute force greedy math number theory *800	0 / 0	3
	817	P1389B Array Walk brute force dp greedy *1600	0 / 0	5
	816	P1389C Good String brute force dp greedy two pointers *1500	0 / 0	5
	815	P1389D Segment Intersections brute force greedy implementation math *2100	0 / 0	7
	810	P1391B Fix You brute force greedy implementation *800	0 / 0	3
	808	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	7
	790	P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	8
	786	P1395A Boboniu Likes to Color Balls brute force math *1000	0 / 0	3
	785	P1395C Boboniu and Bit Operations bitmasks brute force dp greedy *1600	0 / 0	5
	782	P1396B Stoned Game brute force constructive algorithms games greedy *1800	0 / 0	6
	777	P1397B Power Sequence brute force math number theory sortings *1500	0 / 0	5
	767	P1399C Boats Competition brute force greedy two pointers *1200	0 / 0	4
	761	P1400B RPG Protagonist brute force greedy math *1700	0 / 0	5
	760	P1400C Binary String Reconstruction 2-sat brute force constructive algorithms greedy *1500	0 / 0	5
	759	P1400D Zigzags brute force combinatorics data structures math two pointers *1900	1 / 1	6
	757	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	10
	756	P1400G Mercenaries bitmasks brute force combinatorics dp dsu math two pointers *2600	0 / 0	10
	735	P1406B Maximum Product brute force dp greedy implementation sortings *1200	0 / 0	4
	730	P1407B Big Vova brute force greedy math number theory *1300	0 / 0	4
	723	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	7
	716	P1409B Minimum Product brute force greedy math *1100	0 / 0	3
	715	P1409C Yet Another Array Restoration brute force math number theory *1200	0 / 0	4
	710	P1411B Fair Numbers brute force number theory *1000	1 / 1	3
	708	P1411D Grime Zoo brute force greedy implementation strings *2100	0 / 0	7
	702	P1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	6
	698	P1415A Prison Break brute force math *800	1 / 1	3
	696	P1415B Repainting Street brute force brute force greedy *1100	0 / 0	3
	697	P1415C Bouncing Ball brute force dp implementation *1400	0 / 0	4
	694	P1415D XOR-gun bitmasks brute force constructive algorithms *2000	0 / 0	7
	676	P1419B Stairs brute force constructive algorithms greedy implementation math *1200	0 / 0	4
	673	P1419D2 Sage's Birthday (hard version) binary search brute force constructive algorithms greedy sortings two pointers *1500	0 / 0	5
	661	P1421D Hexagons brute force constructive algorithms greedy implementation math shortest paths *1900	0 / 0	6
	660	P1421E Swedish Heroes brute force dp implementation *2700	0 / 0	10
	625	P1426E Rock, Paper, Scissors brute force constructive algorithms flows greedy math *1800	0 / 0	6

根据当前过滤条件随机选择一道题