divide and conquer - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
4650	CF1167B Lost Numbers brute force divide and conquer interactive math *1400	0 / 0	(None)
4609	CF1174F Ehab and the Big Finale constructive algorithms divide and conquer graphs implementation interactive trees *2400	0 / 0	(None)
4604	CF1175E Minimal Segment Cover data structures dfs and similar divide and conquer dp greedy implementation trees *2200	0 / 0	(None)
4603	CF1175F The Number of Subpermutations brute force data structures divide and conquer hashing math *2500	0 / 0	(None)
4602	CF1175G Yet Another Partiton Problem data structures divide and conquer dp geometry two pointers *3000	0 / 0	(None)
4593	CF1177B Digits Sequence (Hard Edition) binary search divide and conquer implementation *1800	0 / 0	(None)
4577	CF1179E Alesya and Discrete Math divide and conquer interactive *3200	0 / 0	(None)
4570	CF1181E1 A Story of One Country (Easy) brute force divide and conquer sortings *2500	0 / 0	(None)
4522	CF1186E Vus the Cossack and a Field divide and conquer implementation math *2500	0 / 0	(None)
4499	CF1190D Tokitsukaze and Strange Rectangle data structures divide and conquer sortings two pointers *2000	0 / 0	(None)
4493	CF1192B Dynamic Diameter *special problem data structures dfs and similar divide and conquer trees	0 / 0	(None)
4350	CF1213G Path Queries divide and conquer dsu graphs sortings trees *1800	0 / 0	(None)
4320	CF1217F Forced Online Queries Problem data structures divide and conquer dsu graphs trees *2600	0 / 0	(None)
4316	CF1218D Xor Spanning Tree divide and conquer fft graphs *2400	0 / 0	(None)
4315	CF1218E Product Tuples divide and conquer fft *2500	0 / 0	(None)
4285	CF1223F Stack Exterminable Arrays data structures divide and conquer dp hashing *2600	0 / 0	(None)
4236	CF1237C2 Balanced Removals (Harder) binary search constructive algorithms divide and conquer greedy implementation sortings *1900	0 / 0	(None)
4162	CF1250M SmartGarden constructive algorithms divide and conquer *2500	0 / 0	(None)
4109	CF1257G Divisor Set divide and conquer fft greedy math number theory *2600	0 / 0	(None)
4101	CF1261F Xor-Set bitmasks divide and conquer math *3100	0 / 0	(None)
4056	CF1268D Invertation in Tournament brute force divide and conquer graphs math *3200	0 / 0	(None)
4015	CF1278E Tests for problem D constructive algorithms dfs and similar divide and conquer trees *2200	0 / 0	(None)
3973	CF1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	(None)
3922	CF1295E Permutation Separation data structures divide and conquer *2200	0 / 0	(None)
3871	CF1303G Sum of Prefix Sums data structures divide and conquer geometry trees *2700	0 / 0	(None)
3832	CF1311F Moving Points data structures divide and conquer implementation sortings *1900	0 / 0	(None)
3808	CF1316F Battalion Strength data structures divide and conquer probabilities *2800	0 / 0	(None)
3698	CF1336F Journey data structures divide and conquer graphs trees *3500	0 / 0	(None)
3693	CF1338C Perfect Triples bitmasks brute force constructive algorithms divide and conquer math *2200	0 / 0	(None)
3520	CF1364E X-OR bitmasks constructive algorithms divide and conquer interactive probabilities *2700	0 / 0	(None)
3465	CF1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	(None)
3459	CF1372F Omkar and Modes binary search divide and conquer interactive *2700	0 / 0	(None)
3454	CF1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	(None)
3451	CF1373G Pawns data structures divide and conquer greedy *2600	0 / 0	(None)
3434	CF1375H Set Merging constructive algorithms divide and conquer *3300	0 / 0	(None)
3428	CF1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	(None)
3426	CF1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	(None)
3394	CF1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	(None)
3387	CF1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	(None)
3310	CF1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	(None)
3269	CF1408F Two Different constructive algorithms divide and conquer *2300	0 / 0	(None)
3234	CF1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	(None)
3221	CF1418G Three Occurrences data structures divide and conquer hashing two pointers *2500	0 / 0	(None)
3209	CF1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	(None)
3192	CF1423C Dušan's Railway divide and conquer graphs trees *3500	0 / 0	(None)
3185	CF1423H Virus data structures divide and conquer dsu graphs *2500	0 / 0	(None)
3174	CF1425B Blue and Red of Our Faculty! divide and conquer dp *2600	0 / 0	(None)
3145	CF1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	(None)
3095	CF1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	(None)
3089	CF1439C Greedy Shopping binary search data structures divide and conquer greedy implementation *2600	0 / 0	(None)
3081	CF1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	(None)
3062	CF1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	(None)
2994	CF1461D Divide and Summarize binary search brute force data structures divide and conquer implementation sortings *1600	0 / 0	(None)
2967	CF1466G Song of the Sirens combinatorics divide and conquer hashing math string suffix structures strings *2600	0 / 0	(None)
2931	CF1470F Strange Covering divide and conquer *3500	0 / 0	(None)
2861	CF1482E Skyline Photo data structures divide and conquer dp *2100	0 / 0	(None)
2819	CF1490D Permutation Transformation dfs and similar divide and conquer implementation *1200	0 / 0	(None)
2810	CF1491E Fib-tree brute force dfs and similar divide and conquer number theory trees *2400	0 / 0	(None)
2789	CF1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	(None)
2740	CF1503F Balance the Cards constructive algorithms data structures divide and conquer geometry graphs implementation *3500	0 / 0	(None)
2617	CF1523G Try Booking data structures divide and conquer *3200	0 / 0	(None)
2595	CF1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	(None)
2594	CF1528A Parsa's Humongous Tree dfs and similar divide and conquer dp greedy trees *1600	0 / 0	(None)
2491	CF1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	(None)
2474	CF1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	0 / 0	(None)
2471	CF1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	(None)
2466	CF1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	(None)
2458	CF1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	(None)
2430	CF1553H XOR and Distance bitmasks divide and conquer trees *2900	0 / 0	(None)
2429	CF1553I Stairs combinatorics divide and conquer dp fft math *3400	0 / 0	(None)
2354	CF1567E Non-Decreasing Dilemma data structures divide and conquer math *2200	0 / 0	(None)
2307	CF1575L Longest Array Deconstruction data structures divide and conquer dp sortings *2100	0 / 0	(None)
2276	CF1580D Subsequence brute force divide and conquer dp greedy trees *2900	0 / 0	(None)
2256	CF1583F Defender of Childhood Dreams bitmasks constructive algorithms divide and conquer *2500	0 / 0	(None)
2254	CF1583H Omkar and Tours data structures divide and conquer sortings trees *3300	0 / 0	(None)
2186	CF1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	(None)
2176	CF1603D Artistic Partition divide and conquer dp number theory *3000	0 / 0	(None)
2136	CF1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	(None)
2100	CF1613F Tree Coloring combinatorics divide and conquer fft *2600	0 / 0	(None)
2085	CF1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	(None)
2075	CF1616H Keep XOR Low bitmasks combinatorics data structures divide and conquer dp math *3000	0 / 0	(None)
2052	CF1619H Permutation and Queries brute force data structures divide and conquer two pointers *2400	0 / 0	(None)
2009	CF1625E1 Cats on the Upgrade (easy version) brute force data structures dfs and similar divide and conquer dp graphs trees *2500	0 / 0	(None)
1962	CF1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	(None)
1916	CF1641E Special Positions combinatorics divide and conquer fft math *3300	0 / 0	(None)
1888	CF1648D Serious Business data structures divide and conquer dp implementation shortest paths *2800	0 / 0	(None)
1887	CF1648E Air Reform data structures dfs and similar divide and conquer dsu graphs implementation trees *3200	0 / 0	(None)
1863	CF1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	(None)
1861	CF1654H Three Minimums combinatorics constructive algorithms divide and conquer dp fft math *3500	0 / 0	(None)
1796	CF1663B Mike's Sequence *special problem divide and conquer implementation math	0 / 0	(None)
1784	CF1665E MinimizOR bitmasks brute force data structures divide and conquer greedy implementation two pointers *2500	0 / 0	(None)
1740	CF1671E Preorder combinatorics divide and conquer dp dsu hashing sortings trees *2100	0 / 0	(None)
1721	CF1673F Anti-Theft Road Planning bitmasks constructive algorithms divide and conquer greedy interactive math *2400	0 / 0	(None)
1696	CF1676H2 Maximum Crossings (Hard Version) data structures divide and conquer sortings *1500	0 / 0	(None)
1673	CF1680F Lenient Vertex Cover dfs and similar divide and conquer dsu graphs trees *2600	0 / 0	(None)
1666	CF1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	(None)
1651	CF1684H Hard Cut constructive algorithms dfs and similar divide and conquer math *3400	0 / 0	(None)
1614	CF1691D Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers *1800	0 / 0	(None)
1598	CF1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	(None)
1583	CF1696D Permutation Graph binary search constructive algorithms data structures divide and conquer greedy shortest paths *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