brute force - 题库 - HydroOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1198	P1321C Remove Adjacent brute force constructive algorithms greedy strings *1600	0 / 0	5
	1192	P1323A Even Subset Sum Problem brute force dp greedy implementation *800	0 / 0	3
	1188	P1324B Yet Another Palindrome Problem brute force strings *1100	0 / 0	3
	1180	P1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	1 / 2	10
	1171	P1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	10
	1167	P1327B Princesses and Princes brute force graphs greedy *1200	0 / 0	4
	1166	P1327D Infinite Path brute force dfs and similar graphs math number theory *2200	0 / 0	8
	1160	P1328B K-th Beautiful String binary search brute force combinatorics implementation math *1300	0 / 0	4
	1142	P1331F Elementary! *special problem brute force dp strings	1 / 1	10
	1138	P1332B Composite Coloring brute force constructive algorithms greedy math number theory *1400	0 / 0	4
	1130	P1333D Challenges in school №41 brute force constructive algorithms games graphs greedy implementation sortings *2100	0 / 0	7
	1129	P1333E Road to 1600 brute force constructive algorithms *2400	0 / 0	9
	1125	P1334C Circle of Monsters brute force constructive algorithms greedy math *1600	0 / 0	5
	1122	P1334G Substring Search bitmasks brute force fft *2900	0 / 0	10
	1116	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	5
	1115	P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	1 / 1	6
	1109	P1336E1 Chiori and Doll Picking (easy version) bitmasks brute force combinatorics math *2700	0 / 0	10
	1108	P1336E2 Chiori and Doll Picking (hard version) bitmasks brute force combinatorics math *3500	0 / 0	10
	1102	P1338C Perfect Triples bitmasks brute force constructive algorithms divide and conquer math *2200	0 / 0	8
	1099	P1339A Filling Diamonds brute force dp implementation math *900	0 / 0	3
	1097	P1340A Nastya and Strange Generator brute force data structures greedy implementation *1500	0 / 0	5
	1092	P1340F Nastya and CBS brute force data structures hashing *3300	0 / 0	10
	1085	P1342F Make It Ascending bitmasks brute force dp *3000	0 / 1	10
	1083	P1343A Candies brute force math *900	0 / 0	3
	1	P1343D Constant Palindrome Sum brute force data structures greedy two pointers *1700	3 / 13	5
	1080	P1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	7
	1079	P1343F Restore the Permutation by Sorted Segments brute force constructive algorithms data structures greedy implementation *2400	0 / 0	9
	1071	P1345B Card Constructions binary search brute force dp math *1100	0 / 0	3
	1057	P1348E Phoenix and Berries brute force dp greedy math *2400	0 / 0	9
	1045	P1351B Square? brute force implementation math *900	0 / 0	3
	1039	P1352E Special Elements brute force implementation two pointers *1500	0 / 0	5
	1032	P1353E K-periodic Garland brute force dp greedy *1900	0 / 0	6
	1030	P1353F Decreasing Heights brute force dp *2200	0 / 0	8
	1027	P1354C2 Not So Simple Polygon Embedding binary search brute force geometry math *2000	0 / 0	7
	1022	P1355A Sequence with Digits brute force implementation math *1200	0 / 0	4
	984	P1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	6
	981	P1359A Berland Poker brute force greedy math *1000	0 / 0	3
	980	P1359B New Theatre Square brute force dp greedy implementation two pointers *1000	2 / 2	3
	976	P1359F RC Kaboom Show binary search brute force data structures geometry math *2900	0 / 0	10
	970	P1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	5
	968	P1360H Binary Median binary search bitmasks brute force constructive algorithms *2100	0 / 0	7
	960	P1362B Johnny and His Hobbies bitmasks brute force *1200	0 / 0	4
	958	P1363A Odd Selection brute force implementation math *1200	0 / 0	4
	952	P1364A XXXXX brute force data structures number theory two pointers *1200	0 / 0	4
	950	P1364C Ehab and Prefix MEXs brute force constructive algorithms greedy *1600	0 / 0	5
	943	P1365E Maximum Subsequence Value brute force constructive algorithms *1900	0 / 0	6
	936	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	7
	929	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	6
	926	P1368A C+= brute force greedy implementation math *800	1 / 1	3
	925	P1368B Codeforces Subsequences brute force constructive algorithms greedy math strings *1500	0 / 1	5

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