brute force - 题库

ID	题目显示标签隐藏标签	AC / 尝试	难度
3445	P1249C1 Good Numbers (easy version) brute force greedy implementation *1300	0 / 0	4
3438	P1250B The Feast and the Bus brute force constructive algorithms greedy math *1800	0 / 0	6
3434	P1250F Data Center brute force implementation *800	0 / 0	3
3431	P1250I Show Must Go On binary search brute force greedy shortest paths *3100	0 / 0	10
3425	P1251A Broken Keyboard brute force strings two pointers *1000	0 / 0	3
3409	P1252J Tiling Terrace brute force dp *2300	0 / 0	8
3380	P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	9
3374	P1260E Tournament brute force dp greedy *2400	0 / 0	9
3364	P1264B Beautiful Sequence brute force constructive algorithms greedy *1900	0 / 0	6
3339	P1267I Intriguing Selection brute force constructive algorithms implementation interactive sortings *2600	0 / 0	10
3332	P1268D Invertation in Tournament brute force divide and conquer graphs math *3200	0 / 0	10
3330	P1269A Equation brute force math *800	0 / 0	3
3329	P1269B Modulo Equality brute force sortings *1500	0 / 0	5
3319	P1271A Suits brute force greedy math *800	0 / 0	3
3317	P1271C Shawarma Tent brute force geometry greedy implementation *1300	0 / 0	4
3314	P1271F Divide The Students brute force *2700	0 / 0	10
3313	P1272A Three Friends brute force greedy math sortings *900	0 / 0	3
3310	P1272D Remove One Element brute force dp *1500	0 / 0	5
3305	P1276C Beautiful Rectangle brute force combinatorics constructive algorithms data structures greedy math *2300	0 / 0	8
3298	P1278A Shuffle Hashing brute force implementation strings *1000	0 / 0	3
3291	P1279B Verse For Santa binary search brute force implementation *1300	0 / 0	4
3257	P1285C Fadi and LCM brute force math number theory *1400	0 / 0	4
3256	P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	6
3255	P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	8
3251	P1286C1 Madhouse (Easy version) brute force constructive algorithms interactive math *2400	0 / 0	9
3250	P1286C2 Madhouse (Hard version) brute force constructive algorithms hashing interactive math *2800	0 / 0	10
3247	P1286F Harry The Potter brute force constructive algorithms dp fft implementation math *3100	0 / 0	10
3245	P1287B Hyperset brute force data structures implementation *1500	0 / 0	5
3244	P1288A Deadline binary search brute force math ternary search *1100	0 / 0	3
3238	P1290A Mind Control brute force data structures implementation *1600	0 / 0	5
3228	P1292B Aroma's Search brute force constructive algorithms geometry greedy implementation *1700	0 / 0	5
3223	P1293A ConneR and the A.R.C binary search brute force implementation *1100	0 / 0	3
3193	P1299A Anu Has a Function brute force greedy math *1500	0 / 0	5
3175	P1302F Keep talking and nobody explodes – easy bitmasks brute force expression parsing	0 / 0	(无)
3162	P1304B Longest Palindrome brute force constructive algorithms greedy implementation strings *1100	0 / 0	3
3156	P1305A Kuroni and the Gifts brute force constructive algorithms greedy sortings *800	0 / 0	3
3154	P1305C Kuroni and Impossible Calculation brute force combinatorics math number theory *1600	0 / 0	5
3150	P1305G Kuroni and Antihype bitmasks brute force dp dsu graphs *3500	0 / 0	10
3146	P1307C Cow and Message brute force dp math strings *1500	0 / 0	5
3133	P1311C Perform the Combo brute force *1300	0 / 0	4
3132	P1311D Three Integers brute force math *2000	0 / 0	7
3131	P1311E Construct the Binary Tree brute force constructive algorithms trees *2200	0 / 0	8
3122	P1313A Fast Food Restaurant brute force greedy implementation *900	0 / 0	3
3120	P1313C1 Skyscrapers (easy version) brute force data structures dp greedy *1500	0 / 0	5
3112	P1316B String Modification brute force constructive algorithms implementation sortings strings *1400	0 / 0	4
3105	P1320C World of Darkraft: Battle for Azathoth brute force data structures sortings *2000	0 / 0	7
3102	P1320F Blocks and Sensors brute force *3500	0 / 0	10
3100	P1321C Remove Adjacent brute force constructive algorithms greedy strings *1600	0 / 0	5
3093	P1323A Even Subset Sum Problem brute force dp greedy implementation *800	0 / 0	3
3090	P1324B Yet Another Palindrome Problem brute force strings *1100	0 / 0	3
3081	P1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	0 / 0	10
3073	P1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	10
3069	P1327B Princesses and Princes brute force graphs greedy *1200	0 / 0	4
3067	P1327D Infinite Path brute force dfs and similar graphs math number theory *2200	0 / 0	8
3062	P1328B K-th Beautiful String binary search brute force combinatorics implementation math *1300	0 / 0	4
3045	P1331F Elementary! *special problem brute force dp strings	0 / 0	(无)
3041	P1332B Composite Coloring brute force constructive algorithms greedy math number theory *1400	0 / 0	4
3032	P1333D Challenges in school №41 brute force constructive algorithms games graphs greedy implementation sortings *2100	0 / 0	7
3031	P1333E Road to 1600 brute force constructive algorithms *2400	0 / 0	9
3027	P1334C Circle of Monsters brute force constructive algorithms greedy math *1600	0 / 0	5
3023	P1334G Substring Search bitmasks brute force fft *2900	0 / 0	10
3018	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	5
3017	P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	6
3011	P1336E1 Chiori and Doll Picking (easy version) bitmasks brute force combinatorics math *2700	0 / 0	10
3010	P1336E2 Chiori and Doll Picking (hard version) bitmasks brute force combinatorics math *3500	0 / 0	10
3004	P1338C Perfect Triples bitmasks brute force constructive algorithms divide and conquer math *2200	0 / 0	8
3001	P1339A Filling Diamonds brute force dp implementation math *900	0 / 0	3
2999	P1340A Nastya and Strange Generator brute force data structures greedy implementation *1500	0 / 0	5
2994	P1340F Nastya and CBS brute force data structures hashing *3300	0 / 0	10
2986	P1342F Make It Ascending bitmasks brute force dp *3000	0 / 0	10
2985	P1343A Candies brute force math *900	0 / 0	3
2982	P1343D Constant Palindrome Sum brute force data structures greedy two pointers *1700	0 / 0	5
2981	P1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	7
2980	P1343F Restore the Permutation by Sorted Segments brute force constructive algorithms data structures greedy implementation *2400	0 / 0	9
2972	P1345B Card Constructions binary search brute force dp math *1100	0 / 0	3
2958	P1348E Phoenix and Berries brute force dp greedy math *2400	0 / 0	9
2946	P1351B Square? brute force implementation math *900	0 / 0	3
2940	P1352E Special Elements brute force implementation two pointers *1500	0 / 0	5
2933	P1353E K-periodic Garland brute force dp greedy *1900	0 / 0	6
2932	P1353F Decreasing Heights brute force dp *2200	0 / 0	8
2928	P1354C2 Not So Simple Polygon Embedding binary search brute force geometry math *2000	0 / 0	7
2923	P1355A Sequence with Digits brute force implementation math *1200	0 / 0	4
2886	P1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	6
2883	P1359A Berland Poker brute force greedy math *1000	0 / 0	3
2882	P1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	3
2878	P1359F RC Kaboom Show binary search brute force data structures geometry math *2900	0 / 0	10
2872	P1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	5
2870	P1360H Binary Median binary search bitmasks brute force constructive algorithms *2100	0 / 0	7
2862	P1362B Johnny and His Hobbies bitmasks brute force *1200	0 / 0	4
2860	P1363A Odd Selection brute force implementation math *1200	0 / 0	4
2854	P1364A XXXXX brute force data structures number theory two pointers *1200	0 / 0	4
2852	P1364C Ehab and Prefix MEXs brute force constructive algorithms greedy *1600	0 / 0	5
2845	P1365E Maximum Subsequence Value brute force constructive algorithms *1900	0 / 0	6
2838	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	7
2831	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	6
2828	P1368A C+= brute force greedy implementation math *800	0 / 0	3
2827	P1368B Codeforces Subsequences brute force constructive algorithms greedy math strings *1500	0 / 0	5
2802	P1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	6
2796	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	7
2789	P1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	8

试试手气

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

分类

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

状态

开发

支持

关于

分类

状态

开发

支持

关于

还没有账户？

登录