*1900 - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
5053	CF1092F Tree with Maximum Cost dfs and similar dp trees *1900	0 / 0	(None)
5040	CF1095E Almost Regular Bracket Sequence implementation *1900	0 / 0	(None)
5039	CF1095F Make It Connected dsu graphs greedy *1900	0 / 0	(None)
4978	CF1105D Kilani and the Game dfs and similar graphs implementation shortest paths *1900	0 / 0	(None)
4927	CF1114D Flood Fill dp *1900	0 / 0	(None)
4900	CF1117C Magic Ship binary search *1900	0 / 0	(None)
4882	CF1119E Pavel and Triangles brute force dp fft greedy ternary search *1900	0 / 0	(None)
4877	CF1120A Diana and Liana greedy implementation two pointers *1900	0 / 0	(None)
4834	CF1133F2 Spanning Tree with One Fixed Degree constructive algorithms dfs and similar dsu graphs greedy *1900	0 / 0	(None)
4799	CF1141F1 Same Sum Blocks (Easy) greedy *1900	0 / 0	(None)
4798	CF1141F2 Same Sum Blocks (Hard) data structures greedy *1900	0 / 0	(None)
4797	CF1141G Privatization of Roads in Treeland binary search constructive algorithms dfs and similar graphs greedy trees *1900	0 / 0	(None)
4783	CF1144E Median String bitmasks math number theory strings *1900	0 / 0	(None)
4762	CF1147B Chladni Figure brute force strings *1900	0 / 0	(None)
4720	CF1153D Serval and Rooted Tree binary search dfs and similar dp greedy trees *1900	0 / 0	(None)
4706	CF1155D Beautiful Array brute force data structures divide and conquer dp greedy *1900	0 / 0	(None)
4691	CF1157D N Problems During K Days constructive algorithms greedy math *1900	0 / 0	(None)
4671	CF1163C1 Power Transmission (Easy Edition) brute force geometry *1900	0 / 0	(None)
4670	CF1163C2 Power Transmission (Hard Edition) data structures geometry implementation math *1900	0 / 0	(None)
4642	CF1168B Good Triple brute force two pointers *1900	0 / 0	(None)
4624	CF1172B Nauuo and Circle combinatorics dfs and similar dp trees *1900	0 / 0	(None)
4611	CF1174D Ehab and the Expected XOR Problem bitmasks constructive algorithms *1900	0 / 0	(None)
4605	CF1175D Array Splitting greedy sortings *1900	0 / 0	(None)
4587	CF1178E Archaeology brute force constructive algorithms greedy strings *1900	0 / 0	(None)
4553	CF1183H Subsequences (hard version) dp strings *1900	0 / 0	(None)
4540	CF1184E1 Daleks' Invasion (easy) graphs trees *1900	0 / 0	(None)
4461	CF1197D Yet Another Subarray Problem dp greedy math *1900	0 / 0	(None)
4445	CF1200D White Lines brute force data structures dp implementation two pointers *1900	0 / 0	(None)
4432	CF1202D Print a 1337-string... combinatorics constructive algorithms math strings *1900	0 / 0	(None)
4411	CF1205B Shortest Cycle bitmasks brute force graphs shortest paths *1900	0 / 0	(None)
4399	CF1207E XOR Guessing bitmasks interactive math *1900	0 / 0	(None)
4393	CF1208D Restore Permutation binary search data structures greedy implementation *1900	0 / 0	(None)
4352	CF1213E Two Small Strings brute force constructive algorithms *1900	0 / 0	(None)
4345	CF1214D Treasure Island dfs and similar dp flows hashing *1900	0 / 0	(None)
4329	CF1216E1 Numerical Sequence (easy version) binary search brute force math *1900	0 / 0	(None)
4304	CF1220D Alex and Julian bitmasks math number theory *1900	0 / 0	(None)
4261	CF1228D Complete Tripartite brute force constructive algorithms graphs hashing implementation *1900	0 / 0	(None)
4236	CF1237C2 Balanced Removals (Harder) binary search constructive algorithms divide and conquer greedy implementation sortings *1900	0 / 0	(None)
4226	CF1238D AB-string binary search combinatorics dp strings *1900	0 / 0	(None)
4212	CF1242B 0-1 MST dfs and similar dsu graphs sortings *1900	0 / 0	(None)
4194	CF1245D Shichikuji and Power Grid dsu graphs greedy shortest paths trees *1900	0 / 0	(None)
4156	CF1251D Salary Changing binary search greedy sortings *1900	0 / 0	(None)
4105	CF1260D A Game with Traps binary search dp greedy sortings *1900	0 / 0	(None)
4093	CF1264B Beautiful Sequence brute force constructive algorithms greedy *1900	0 / 0	(None)
4049	CF1270D Strange Device constructive algorithms interactive math sortings *1900	0 / 0	(None)
4031	CF1272E Nearest Opposite Parity dfs and similar graphs shortest paths *1900	0 / 0	(None)
4028	CF1276B Two Fairs combinatorics dfs and similar dsu graphs *1900	0 / 0	(None)
4020	CF1277D Let's Play the Words? data structures hashing implementation math *1900	0 / 0	(None)
3973	CF1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	(None)
3929	CF1294E Obtain a Permutation greedy implementation math *1900	0 / 0	(None)
3874	CF1303D Fill The Bag bitmasks greedy *1900	0 / 0	(None)
3859	CF1305D Kuroni and the Celebration constructive algorithms dfs and similar interactive trees *1900	0 / 0	(None)
3849	CF1307D Cow and Fields binary search data structures dfs and similar graphs greedy shortest paths sortings *1900	0 / 0	(None)
3832	CF1311F Moving Points data structures divide and conquer implementation sortings *1900	0 / 0	(None)
3820	CF1313C2 Skyscrapers (hard version) data structures dp greedy *1900	0 / 0	(None)
3754	CF1328E Tree Queries dfs and similar graphs trees *1900	0 / 0	(None)
3675	CF1342D Multiple Testcases binary search constructive algorithms data structures greedy sortings two pointers *1900	0 / 0	(None)
3643	CF1348D Phoenix and Science binary search constructive algorithms greedy implementation math *1900	0 / 0	(None)
3613	CF1353E K-periodic Garland brute force dp greedy *1900	0 / 0	(None)
3606	CF1354D Multiset binary search data structures *1900	0 / 0	(None)
3561	CF1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	(None)
3544	CF1360G A/B Matrix constructive algorithms greedy math *1900	0 / 0	(None)
3541	CF1361B Johnny and Grandmaster greedy implementation math sortings *1900	0 / 0	(None)
3515	CF1365E Maximum Subsequence Value brute force constructive algorithms *1900	0 / 0	(None)
3499	CF1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	(None)
3483	CF1369D TediousLee dp graphs greedy math trees *1900	0 / 0	(None)
3467	CF1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	(None)
3439	CF1375D Replace by MEX brute force constructive algorithms sortings *1900	0 / 0	(None)
3406	CF1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	(None)
3399	CF1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	(None)
3311	CF1400D Zigzags brute force combinatorics data structures math two pointers *1900	0 / 0	(None)
3292	CF1404B Tree Tag dfs and similar dp games trees *1900	0 / 0	(None)
3248	CF1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	(None)
3203	CF1421D Hexagons brute force constructive algorithms greedy implementation math shortest paths *1900	0 / 0	(None)
3193	CF1423B Valuable Paper binary search flows graph matchings graphs *1900	0 / 0	(None)
3148	CF1428D Bouncing Boomerangs constructive algorithms greedy implementation *1900	0 / 0	(None)
3137	CF1430E String Reversal data structures greedy strings *1900	0 / 0	(None)
3110	CF1436D Bandit in a City binary search dfs and similar graphs greedy trees *1900	0 / 0	(None)
3092	CF1439A2 Binary Table (Hard Version) constructive algorithms graphs greedy implementation *1900	0 / 0	(None)
3071	CF1444B Divide and Sum combinatorics math sortings *1900	0 / 0	(None)
3025	CF1453D Checkpoints brute force constructive algorithms greedy math probabilities *1900	0 / 0	(None)
2979	CF1463D Pairs binary search constructive algorithms greedy two pointers *1900	0 / 0	(None)
2962	CF1467C Three Bags constructive algorithms greedy *1900	0 / 0	(None)
2936	CF1470B Strange Definition bitmasks graphs hashing math number theory *1900	0 / 0	(None)
2900	CF1475F Unusual Matrix 2-sat brute force constructive algorithms *1900	0 / 0	(None)
2899	CF1475G Strange Beauty dp math number theory sortings *1900	0 / 0	(None)
2889	CF1477B Nezzar and Binary String data structures greedy *1900	0 / 0	(None)
2879	CF1479B1 Painting the Array I constructive algorithms data structures dp greedy implementation *1900	0 / 0	(None)
2862	CF1482D Playlist data structures dsu implementation shortest paths *1900	0 / 0	(None)
2845	CF1486C2 Guessing the Greatest (hard version) binary search interactive *1900	0 / 0	(None)
2831	CF1488C Two Policemen special problem binary search brute force math 1900	0 / 0	(None)
2830	CF1488D Problemsolving Marathon special problem binary search greedy 1900	0 / 0	(None)
2816	CF1490G Old Floppy Drive binary search data structures math *1900	0 / 0	(None)
2801	CF1492D Genius's Gambit bitmasks constructive algorithms greedy math *1900	0 / 0	(None)
2790	CF1494C 1D Sokoban binary search dp greedy implementation two pointers *1900	0 / 0	(None)
2785	CF1495B Let's Go Hiking games greedy *1900	0 / 0	(None)
2719	CF1508A Binary Literature constructive algorithms greedy implementation strings two pointers *1900	0 / 0	(None)
2684	CF1512F Education brute force dp greedy implementation *1900	0 / 0	(None)
2598	CF1527B2 Palindrome Game (hard version) constructive algorithms games *1900	0 / 0	(None)
2494	CF1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *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