brute force - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
4859	CF1130C Connect brute force dfs and similar dsu *1400	0 / 0	(None)
4847	CF1132C Painting the Fence brute force *1700	0 / 0	(None)
4820	CF1138B Circus brute force greedy math strings *1800	0 / 0	(None)
4810	CF1140C Playlist brute force data structures sortings *1600	0 / 0	(None)
4796	CF1142A The Beatles brute force math *1700	0 / 0	(None)
4789	CF1143B Nirvana brute force math number theory *1200	0 / 0	(None)
4778	CF1145B Kanban Numbers brute force	0 / 0	(None)
4777	CF1145C Mystery Circuit bitmasks brute force	0 / 0	(None)
4762	CF1147B Chladni Figure brute force strings *1900	0 / 0	(None)
4755	CF1148B Born This Way binary search brute force two pointers *1600	0 / 0	(None)
4742	CF1149D Abandoning Roads brute force dp graphs greedy *3000	0 / 0	(None)
4738	CF1151A Maxim and Biology brute force strings *1000	0 / 0	(None)
4737	CF1151B Dima and a Bad XOR bitmasks brute force constructive algorithms dp *1600	0 / 0	(None)
4729	CF1152C Neko does Maths brute force math number theory *1800	0 / 0	(None)
4724	CF1153A Serval and Bus brute force math *1000	0 / 0	(None)
4719	CF1153E Serval and Snake binary search brute force interactive *2200	0 / 0	(None)
4710	CF1154G Minimum Possible LCM brute force greedy math number theory *2200	0 / 0	(None)
4706	CF1155D Beautiful Array brute force data structures divide and conquer dp greedy *1900	0 / 0	(None)
4705	CF1155E Guess the Root brute force interactive math *2200	0 / 0	(None)
4704	CF1155F Delivery Oligopoly brute force dp graphs *2800	0 / 0	(None)
4687	CF1157G Inverse of Rows and Columns brute force constructive algorithms *2200	0 / 0	(None)
4675	CF1162B Double Matrix brute force greedy *1400	0 / 0	(None)
4671	CF1163C1 Power Transmission (Easy Edition) brute force geometry *1900	0 / 0	(None)
4667	CF1163E Magical Permutation bitmasks brute force constructive algorithms data structures graphs math *2400	0 / 0	(None)
4654	CF1166D Cute Sequences binary search brute force greedy math *2200	0 / 0	(None)
4653	CF1166E The LCMs Must be Large bitmasks brute force constructive algorithms math number theory *2100	0 / 0	(None)
4651	CF1167A Telephone Number brute force greedy strings *800	0 / 0	(None)
4650	CF1167B Lost Numbers brute force divide and conquer interactive math *1400	0 / 0	(None)
4644	CF1167G Low Budget Inception brute force geometry *3100	0 / 0	(None)
4642	CF1168B Good Triple brute force two pointers *1900	0 / 0	(None)
4606	CF1175C Electrification binary search brute force greedy *1600	0 / 0	(None)
4603	CF1175F The Number of Subpermutations brute force data structures divide and conquer hashing math *2500	0 / 0	(None)
4600	CF1176A Divide it! brute force greedy implementation *800	0 / 0	(None)
4587	CF1178E Archaeology brute force constructive algorithms greedy strings *1900	0 / 0	(None)
4570	CF1181E1 A Story of One Country (Easy) brute force divide and conquer sortings *2500	0 / 0	(None)
4569	CF1181E2 A Story of One Country (Hard) brute force greedy sortings *3000	0 / 0	(None)
4555	CF1183F Topforces Strikes Back brute force math sortings *2100	0 / 0	(None)
4552	CF1184A1 Heidi Learns Hashing (Easy) brute force math number theory *1200	0 / 0	(None)
4551	CF1184A2 Heidi Learns Hashing (Medium) brute force number theory *2100	0 / 0	(None)
4533	CF1185C2 Exam in BerSU (hard version) brute force data structures greedy math *1700	0 / 0	(None)
4531	CF1185E Polycarp and Snakes brute force implementation *2000	0 / 0	(None)
4530	CF1185F Two Pizzas bitmasks brute force *2100	0 / 0	(None)
4500	CF1190C Tokitsukaze and Duel brute force games greedy *2300	0 / 0	(None)
4496	CF1191A Tokitsukaze and Enhancement brute force *800	0 / 0	(None)
4495	CF1191B Tokitsukaze and Mahjong brute force implementation *1200	0 / 0	(None)
4492	CF1192C Cubeword *special problem brute force dp meet-in-the-middle	0 / 0	(None)
4483	CF1194E Count The Rectangles bitmasks brute force data structures geometry sortings *2200	0 / 0	(None)
4478	CF1195B Sport Mafia binary search brute force math *1000	0 / 0	(None)
4472	CF1196A Three Piles of Candies brute force constructive algorithms math *800	0 / 0	(None)
4465	CF1196F K-th Path brute force constructive algorithms shortest paths sortings *2200	0 / 0	(None)
4456	CF1198B Welfare State binary search brute force data structures sortings *1600	0 / 0	(None)
4449	CF1200A Hotelier brute force data structures implementation *800	0 / 0	(None)
4445	CF1200D White Lines brute force data structures dp implementation two pointers *1900	0 / 0	(None)
4444	CF1200E Compress Words brute force hashing implementation string suffix structures strings *2000	0 / 0	(None)
4443	CF1200F Graph Traveler brute force data structures dfs and similar dp graphs implementation math number theory *2300	0 / 0	(None)
4434	CF1202B You Are Given a Decimal String... brute force dp shortest paths *1700	0 / 0	(None)
4433	CF1202C You Are Given a WASD-string... brute force data structures dp greedy implementation math strings *2100	0 / 0	(None)
4431	CF1202E You Are Given Some Strings... brute force string suffix structures strings *2400	0 / 0	(None)
4417	CF1204D1 Kirk and a Binary String (easy version) brute force greedy strings *2000	0 / 0	(None)
4411	CF1205B Shortest Cycle bitmasks brute force graphs shortest paths *1900	0 / 0	(None)
4404	CF1207A There Are Two Types Of Burgers brute force greedy implementation math *800	0 / 0	(None)
4398	CF1207F Remainder Problem brute force data structures implementation *2100	0 / 0	(None)
4395	CF1208B Uniqueness binary search brute force implementation two pointers *1500	0 / 0	(None)
4383	CF1209E1 Rotate Columns (easy version) bitmasks brute force dp greedy sortings *2000	0 / 0	(None)
4376	CF1210A Anadi and Domino brute force graphs *1700	0 / 0	(None)
4375	CF1210B Marcin and Training Camp brute force greedy *1700	0 / 0	(None)
4371	CF1210F1 Marek and Matching (easy version) brute force probabilities *3100	0 / 0	(None)
4370	CF1210F2 Marek and Matching (hard version) brute force probabilities *3200	0 / 0	(None)
4354	CF1213D1 Equalizing by Division (easy version) brute force implementation *1500	0 / 0	(None)
4353	CF1213D2 Equalizing by Division (hard version) brute force math sortings *1600	0 / 0	(None)
4352	CF1213E Two Small Strings brute force constructive algorithms *1900	0 / 0	(None)
4349	CF1214A Optimal Currency Exchange brute force math *1400	0 / 0	(None)
4348	CF1214B Badges brute force math *1100	0 / 0	(None)
4329	CF1216E1 Numerical Sequence (easy version) binary search brute force math *1900	0 / 0	(None)
4323	CF1217C The Number Of Good Substrings binary search bitmasks brute force *1700	0 / 0	(None)
4298	CF1221A 2048 Game brute force greedy math *1000	0 / 0	(None)
4292	CF1221G Graph And Numbers bitmasks brute force combinatorics dp meet-in-the-middle *2900	0 / 0	(None)
4280	CF1225C p-binary bitmasks brute force math *1600	0 / 0	(None)
4264	CF1228A Distinct Digits brute force implementation *800	0 / 0	(None)
4261	CF1228D Complete Tripartite brute force constructive algorithms graphs hashing implementation *1900	0 / 0	(None)
4258	CF1230A Dawid and Bags of Candies brute force implementation *800	0 / 0	(None)
4245	CF1236A Stones brute force greedy math *800	0 / 0	(None)
4242	CF1236D Alice and the Doll brute force data structures greedy implementation *2300	0 / 0	(None)
4204	CF1244B Rooms and Staircases brute force implementation *1000	0 / 0	(None)
4203	CF1244C The Football Season brute force math number theory *2000	0 / 0	(None)
4201	CF1244D Paint the Tree brute force constructive algorithms dp graphs implementation trees *1800	0 / 0	(None)
4192	CF1245F Daniel and Spring Cleaning bitmasks brute force combinatorics dp *2300	0 / 0	(None)
4186	CF1248D1 The World Is Just a Programming Task (Easy Version) brute force dp greedy implementation *2000	0 / 0	(None)
4182	CF1249C1 Good Numbers (easy version) brute force greedy implementation *1300	0 / 0	(None)
4174	CF1250B The Feast and the Bus brute force constructive algorithms greedy math *1800	0 / 0	(None)
4170	CF1250F Data Center brute force implementation *800	0 / 0	(None)
4166	CF1250I Show Must Go On binary search brute force greedy shortest paths *3100	0 / 0	(None)
4160	CF1251A Broken Keyboard brute force strings two pointers *1000	0 / 0	(None)
4142	CF1252J Tiling Terrace brute force dp *2300	0 / 0	(None)
4110	CF1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	(None)
4104	CF1260E Tournament brute force dp greedy *2400	0 / 0	(None)
4093	CF1264B Beautiful Sequence brute force constructive algorithms greedy *1900	0 / 0	(None)
4064	CF1267I Intriguing Selection brute force constructive algorithms implementation interactive sortings *2600	0 / 0	(None)
4056	CF1268D Invertation in Tournament brute force divide and conquer graphs math *3200	0 / 0	(None)
4054	CF1269A Equation brute force math *800	0 / 0	(None)

Lucky

Pick a problem randomly based on the current filter.

Categories

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

Status

Development

Support

About

Categories

Status

Development

Support

About

Don't have an account?

SIGN IN