brute force - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
4053	CF1269B Modulo Equality brute force sortings *1500	0 / 0	(None)
4042	CF1271A Suits brute force greedy math *800	0 / 0	(None)
4040	CF1271C Shawarma Tent brute force geometry greedy implementation *1300	0 / 0	(None)
4037	CF1271F Divide The Students brute force *2700	0 / 0	(None)
4036	CF1272A Three Friends brute force greedy math sortings *900	0 / 0	(None)
4032	CF1272D Remove One Element brute force dp *1500	0 / 0	(None)
4027	CF1276C Beautiful Rectangle brute force combinatorics constructive algorithms data structures greedy math *2300	0 / 0	(None)
4019	CF1278A Shuffle Hashing brute force implementation strings *1000	0 / 0	(None)
4011	CF1279B Verse For Santa binary search brute force implementation *1300	0 / 0	(None)
3974	CF1285C Fadi and LCM brute force math number theory *1400	0 / 0	(None)
3973	CF1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	(None)
3972	CF1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	(None)
3966	CF1286C1 Madhouse (Easy version) brute force constructive algorithms interactive math *2400	0 / 0	(None)
3965	CF1286C2 Madhouse (Hard version) brute force constructive algorithms hashing interactive math *2800	0 / 0	(None)
3962	CF1286F Harry The Potter brute force constructive algorithms dp fft implementation math *3100	0 / 0	(None)
3960	CF1287B Hyperset brute force data structures implementation *1500	0 / 0	(None)
3959	CF1288A Deadline binary search brute force math ternary search *1100	0 / 0	(None)
3952	CF1290A Mind Control brute force data structures implementation *1600	0 / 0	(None)
3941	CF1292B Aroma's Search brute force constructive algorithms geometry greedy implementation *1700	0 / 0	(None)
3936	CF1293A ConneR and the A.R.C binary search brute force implementation *1100	0 / 0	(None)
3903	CF1299A Anu Has a Function brute force greedy math *1500	0 / 0	(None)
3883	CF1302F Keep talking and nobody explodes – easy bitmasks brute force expression parsing	0 / 0	(None)
3868	CF1304B Longest Palindrome brute force constructive algorithms greedy implementation strings *1100	0 / 0	(None)
3862	CF1305A Kuroni and the Gifts brute force constructive algorithms greedy sortings *800	0 / 0	(None)
3860	CF1305C Kuroni and Impossible Calculation brute force combinatorics math number theory *1600	0 / 0	(None)
3854	CF1305G Kuroni and Antihype bitmasks brute force dp dsu graphs *3500	0 / 0	(None)
3850	CF1307C Cow and Message brute force dp math strings *1500	0 / 0	(None)
3836	CF1311C Perform the Combo brute force *1300	0 / 0	(None)
3834	CF1311D Three Integers brute force math *2000	0 / 0	(None)
3833	CF1311E Construct the Binary Tree brute force constructive algorithms trees *2200	0 / 0	(None)
3823	CF1313A Fast Food Restaurant brute force greedy implementation *900	0 / 0	(None)
3821	CF1313C1 Skyscrapers (easy version) brute force data structures dp greedy *1500	0 / 0	(None)
3812	CF1316B String Modification brute force constructive algorithms implementation sortings strings *1400	0 / 0	(None)
3805	CF1320C World of Darkraft: Battle for Azathoth brute force data structures sortings *2000	0 / 0	(None)
3801	CF1320F Blocks and Sensors brute force *3500	0 / 0	(None)
3799	CF1321C Remove Adjacent brute force constructive algorithms greedy strings *1600	0 / 0	(None)
3792	CF1323A Even Subset Sum Problem brute force dp greedy implementation *800	0 / 0	(None)
3788	CF1324B Yet Another Palindrome Problem brute force strings *1100	0 / 0	(None)
3778	CF1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	0 / 0	(None)
3770	CF1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	(None)
3765	CF1327B Princesses and Princes brute force graphs greedy *1200	0 / 0	(None)
3763	CF1327D Infinite Path brute force dfs and similar graphs math number theory *2200	0 / 0	(None)
3757	CF1328B K-th Beautiful String binary search brute force combinatorics implementation math *1300	0 / 0	(None)
3738	CF1331F Elementary! *special problem brute force dp strings	0 / 0	(None)
3733	CF1332B Composite Coloring brute force constructive algorithms greedy math number theory *1400	0 / 0	(None)
3723	CF1333D Challenges in school №41 brute force constructive algorithms games graphs greedy implementation sortings *2100	0 / 0	(None)
3722	CF1333E Road to 1600 brute force constructive algorithms *2400	0 / 0	(None)
3718	CF1334C Circle of Monsters brute force constructive algorithms greedy math *1600	0 / 0	(None)
3714	CF1334G Substring Search bitmasks brute force fft *2900	0 / 0	(None)
3708	CF1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	(None)
3707	CF1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	(None)
3700	CF1336E1 Chiori and Doll Picking (easy version) bitmasks brute force combinatorics math *2700	0 / 0	(None)
3699	CF1336E2 Chiori and Doll Picking (hard version) bitmasks brute force combinatorics math *3500	0 / 0	(None)
3693	CF1338C Perfect Triples bitmasks brute force constructive algorithms divide and conquer math *2200	0 / 0	(None)
3689	CF1339A Filling Diamonds brute force dp implementation math *900	0 / 0	(None)
3687	CF1340A Nastya and Strange Generator brute force data structures greedy implementation *1500	0 / 0	(None)
3682	CF1340F Nastya and CBS brute force data structures hashing *3300	0 / 0	(None)
3673	CF1342F Make It Ascending bitmasks brute force dp *3000	0 / 0	(None)
3672	CF1343A Candies brute force math *900	0 / 0	(None)
3668	CF1343D Constant Palindrome Sum brute force data structures greedy two pointers *1700	0 / 0	(None)
3667	CF1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	(None)
3666	CF1343F Restore the Permutation by Sorted Segments brute force constructive algorithms data structures greedy implementation *2400	0 / 0	(None)
3657	CF1345B Card Constructions binary search brute force dp math *1100	0 / 0	(None)
3642	CF1348E Phoenix and Berries brute force dp greedy math *2400	0 / 0	(None)
3627	CF1351B Square? brute force implementation math *900	0 / 0	(None)
3620	CF1352E Special Elements brute force implementation two pointers *1500	0 / 0	(None)
3613	CF1353E K-periodic Garland brute force dp greedy *1900	0 / 0	(None)
3611	CF1353F Decreasing Heights brute force dp *2200	0 / 0	(None)
3607	CF1354C2 Not So Simple Polygon Embedding binary search brute force geometry math *2000	0 / 0	(None)
3602	CF1355A Sequence with Digits brute force implementation math *1200	0 / 0	(None)
3561	CF1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	(None)
3558	CF1359A Berland Poker brute force greedy math *1000	0 / 0	(None)
3556	CF1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	(None)
3552	CF1359F RC Kaboom Show binary search brute force data structures geometry math *2900	0 / 0	(None)
3545	CF1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	(None)
3543	CF1360H Binary Median binary search bitmasks brute force constructive algorithms *2100	0 / 0	(None)
3534	CF1362B Johnny and His Hobbies bitmasks brute force *1200	0 / 0	(None)
3532	CF1363A Odd Selection brute force implementation math *1200	0 / 0	(None)
3526	CF1364A XXXXX brute force data structures number theory two pointers *1200	0 / 0	(None)
3522	CF1364C Ehab and Prefix MEXs brute force constructive algorithms greedy *1600	0 / 0	(None)
3515	CF1365E Maximum Subsequence Value brute force constructive algorithms *1900	0 / 0	(None)
3507	CF1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	(None)
3499	CF1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	(None)
3496	CF1368A C+= brute force greedy implementation math *800	0 / 0	(None)
3495	CF1368B Codeforces Subsequences brute force constructive algorithms greedy math strings *1500	0 / 0	(None)
3467	CF1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	(None)
3461	CF1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	(None)
3453	CF1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	(None)
3443	CF1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	(None)
3439	CF1375D Replace by MEX brute force constructive algorithms sortings *1900	0 / 0	(None)
3436	CF1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(None)
3432	CF1379A Acacius and String brute force implementation strings *1500	0 / 0	(None)
3431	CF1379B Dubious Cyrpto binary search brute force math number theory *1500	0 / 0	(None)
3430	CF1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(None)
3429	CF1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	(None)
3425	CF1380A Three Indices brute force data structures *900	0 / 0	(None)
3422	CF1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	(None)
3409	CF1382A Common Subsequence brute force *800	0 / 0	(None)
3404	CF1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	(None)
3399	CF1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	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