brute force - 题库

ID	题目显示标签隐藏标签	AC / 尝试	难度
4136	P1109D Sasha and Interesting Fact from Graph Theory brute force combinatorics dp math trees *2400	0 / 0	9
4124	P1111B Average Superhero Gang Power brute force implementation math *1700	0 / 0	5
4123	P1111C Creative Snap binary search brute force divide and conquer math *1700	0 / 0	5
4118	P1114A Got Any Grapes? brute force greedy implementation *800	0 / 0	3
4116	P1114C Trailing Loves (or L'oeufs?) brute force implementation math number theory *1700	0 / 0	5
4083	P1118D1 Coffee and Coursework (Easy version) brute force greedy *1700	0 / 0	5
4074	P1119E Pavel and Triangles brute force dp fft greedy ternary search *1900	0 / 0	6
4066	P1120E The very same Munchhausen brute force *2600	0 / 0	10
4063	P1121B Mike and Children brute force implementation *1200	0 / 0	4
4061	P1129A1 Toy Train (Simplified) brute force greedy *1700	0 / 0	5
4060	P1129A2 Toy Train brute force greedy *1800	0 / 0	6
4053	P1130C Connect brute force dfs and similar dsu *1400	0 / 0	4
4043	P1132C Painting the Fence brute force *1700	0 / 0	5
4019	P1138B Circus brute force greedy math strings *1800	0 / 0	6
4010	P1140C Playlist brute force data structures sortings *1600	0 / 0	5
3997	P1142A The Beatles brute force math *1700	0 / 0	5
3991	P1143B Nirvana brute force math number theory *1200	0 / 0	4
3981	P1145B Kanban Numbers brute force	0 / 0	(无)
3980	P1145C Mystery Circuit bitmasks brute force	0 / 0	(无)
3966	P1147B Chladni Figure brute force strings *1900	0 / 0	6
3960	P1148B Born This Way binary search brute force two pointers *1600	0 / 0	5
3950	P1149D Abandoning Roads brute force dp graphs greedy *3000	0 / 0	10
3946	P1151A Maxim and Biology brute force strings *1000	0 / 0	3
3945	P1151B Dima and a Bad XOR bitmasks brute force constructive algorithms dp *1600	0 / 0	5
3938	P1152C Neko does Maths brute force math number theory *1800	0 / 0	6
3933	P1153A Serval and Bus brute force math *1000	0 / 0	3
3929	P1153E Serval and Snake binary search brute force interactive *2200	0 / 0	8
3921	P1154G Minimum Possible LCM brute force greedy math number theory *2200	0 / 0	8
3917	P1155D Beautiful Array brute force data structures divide and conquer dp greedy *1900	0 / 0	6
3916	P1155E Guess the Root brute force interactive math *2200	0 / 0	8
3915	P1155F Delivery Oligopoly brute force dp graphs *2800	0 / 0	10
3900	P1157G Inverse of Rows and Columns brute force constructive algorithms *2200	0 / 0	8
3889	P1162B Double Matrix brute force greedy *1400	0 / 0	4
3885	P1163C1 Power Transmission (Easy Edition) brute force geometry *1900	0 / 0	6
3882	P1163E Magical Permutation bitmasks brute force constructive algorithms data structures graphs math *2400	0 / 0	9
3870	P1166D Cute Sequences binary search brute force greedy math *2200	0 / 0	8
3869	P1166E The LCMs Must be Large bitmasks brute force constructive algorithms math number theory *2100	0 / 0	7
3867	P1167A Telephone Number brute force greedy strings *800	0 / 0	3
3866	P1167B Lost Numbers brute force divide and conquer interactive math *1400	0 / 0	4
3861	P1167G Low Budget Inception brute force geometry *3100	0 / 0	10
3859	P1168B Good Triple brute force two pointers *1900	0 / 0	6
3827	P1175C Electrification binary search brute force greedy *1600	0 / 0	5
3824	P1175F The Number of Subpermutations brute force data structures divide and conquer hashing math *2500	0 / 0	9
3822	P1176A Divide it! brute force greedy implementation *800	0 / 0	3
3810	P1178E Archaeology brute force constructive algorithms greedy strings *1900	0 / 0	6
3796	P1181C Flag brute force combinatorics dp implementation *1900	0 / 0	6
3794	P1181E1 A Story of One Country (Easy) brute force divide and conquer sortings *2500	0 / 0	9
3793	P1181E2 A Story of One Country (Hard) brute force greedy sortings *3000	0 / 0	10
3781	P1183F Topforces Strikes Back brute force math sortings *2100	0 / 0	7
3778	P1184A1 Heidi Learns Hashing (Easy) brute force math number theory *1200	0 / 0	4
3777	P1184A2 Heidi Learns Hashing (Medium) brute force number theory *2100	0 / 0	7
3761	P1185C2 Exam in BerSU (hard version) brute force data structures greedy math *1700	0 / 0	5
3759	P1185E Polycarp and Snakes brute force implementation *2000	0 / 0	7
3758	P1185F Two Pizzas bitmasks brute force *2100	0 / 0	7
3732	P1190C Tokitsukaze and Duel brute force games greedy *2300	0 / 0	8
3728	P1191A Tokitsukaze and Enhancement brute force *800	0 / 0	3
3727	P1191B Tokitsukaze and Mahjong brute force implementation *1200	0 / 0	4
3724	P1192C Cubeword *special problem brute force dp meet-in-the-middle	0 / 0	(无)
3716	P1194E Count The Rectangles bitmasks brute force data structures geometry sortings *2200	0 / 0	8
3712	P1195B Sport Mafia binary search brute force math *1000	0 / 0	3
3706	P1196A Three Piles of Candies brute force constructive algorithms math *800	0 / 0	3
3700	P1196F K-th Path brute force constructive algorithms shortest paths sortings *2200	0 / 0	8
3692	P1198B Welfare State binary search brute force data structures sortings *1600	0 / 0	5
3685	P1200A Hotelier brute force data structures implementation *800	0 / 0	3
3682	P1200D White Lines brute force data structures dp implementation two pointers *1900	0 / 0	6
3681	P1200E Compress Words brute force hashing implementation string suffix structures strings *2000	0 / 0	7
3680	P1200F Graph Traveler brute force data structures dfs and similar dp graphs implementation math number theory *2300	0 / 0	8
3672	P1202B You Are Given a Decimal String... brute force dp shortest paths *1700	0 / 0	5
3671	P1202C You Are Given a WASD-string... brute force data structures dp greedy implementation math strings *2100	0 / 0	7
3669	P1202E You Are Given Some Strings... brute force string suffix structures strings *2400	0 / 0	9
3656	P1204D1 Kirk and a Binary String (easy version) brute force greedy strings *2000	0 / 0	7
3652	P1205B Shortest Cycle bitmasks brute force graphs shortest paths *1900	0 / 0	6
3645	P1207A There Are Two Types Of Burgers brute force greedy implementation math *800	0 / 0	3
3640	P1207F Remainder Problem brute force data structures implementation *2100	0 / 0	7
3637	P1208B Uniqueness binary search brute force implementation two pointers *1500	0 / 0	5
3626	P1209E1 Rotate Columns (easy version) bitmasks brute force dp greedy sortings *2000	0 / 0	7
3620	P1210A Anadi and Domino brute force graphs *1700	0 / 0	5
3619	P1210B Marcin and Training Camp brute force greedy *1700	0 / 0	5
3615	P1210F1 Marek and Matching (easy version) brute force probabilities *3100	0 / 0	10
3614	P1210F2 Marek and Matching (hard version) brute force probabilities *3200	0 / 0	10
3600	P1213D1 Equalizing by Division (easy version) brute force implementation *1500	0 / 0	5
3599	P1213D2 Equalizing by Division (hard version) brute force math sortings *1600	0 / 0	5
3598	P1213E Two Small Strings brute force constructive algorithms *1900	0 / 0	6
3595	P1214A Optimal Currency Exchange brute force math *1400	0 / 0	4
3594	P1214B Badges brute force math *1100	0 / 0	3
3577	P1216E1 Numerical Sequence (easy version) binary search brute force math *1900	0 / 0	6
3572	P1217C The Number Of Good Substrings binary search bitmasks brute force *1700	0 / 0	5
3550	P1221A 2048 Game brute force greedy math *1000	0 / 0	3
3544	P1221G Graph And Numbers bitmasks brute force combinatorics dp meet-in-the-middle *2900	0 / 0	10
3533	P1225C p-binary bitmasks brute force math *1600	0 / 0	5
3519	P1228A Distinct Digits brute force implementation *800	0 / 0	3
3516	P1228D Complete Tripartite brute force constructive algorithms graphs hashing implementation *1900	0 / 0	6
3513	P1230A Dawid and Bags of Candies brute force implementation *800	0 / 0	3
3502	P1236A Stones brute force greedy math *800	0 / 0	3
3499	P1236D Alice and the Doll brute force data structures greedy implementation *2300	0 / 0	8
3464	P1244B Rooms and Staircases brute force implementation *1000	0 / 0	3
3463	P1244C The Football Season brute force math number theory *2000	0 / 0	7
3462	P1244D Paint the Tree brute force constructive algorithms dp graphs implementation trees *1800	0 / 0	6
3453	P1245F Daniel and Spring Cleaning bitmasks brute force combinatorics dp *2300	0 / 0	8
3449	P1248D1 The World Is Just a Programming Task (Easy Version) brute force dp greedy implementation *2000	0 / 0	7

试试手气

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

分类

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

状态

开发

支持

关于

分类

状态

开发

支持

关于

还没有账户？

登录