dfs and similar - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
3364	CF1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	(None)
3356	CF1392G Omkar and Pies bitmasks dfs and similar dp math shortest paths *2900	0 / 0	(None)
3350	CF1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	(None)
3345	CF1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	(None)
3333	CF1396E Distance Matching constructive algorithms dfs and similar trees *3200	0 / 0	(None)
3318	CF1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	(None)
3317	CF1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	(None)
3309	CF1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	(None)
3304	CF1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	(None)
3297	CF1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	0 / 0	(None)
3295	CF1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	(None)
3292	CF1404B Tree Tag dfs and similar dp games trees *1900	0 / 0	(None)
3289	CF1404D Game of Pairs constructive algorithms dfs and similar interactive math number theory *2800	0 / 0	(None)
3283	CF1406C Link Cut Centroids constructive algorithms dfs and similar graphs trees *1700	0 / 0	(None)
3275	CF1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	(None)
3255	CF1411C Peaceful Rooks dfs and similar dsu graphs *1700	0 / 0	(None)
3214	CF1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	(None)
3134	CF1430G Yet Another DAG Problem bitmasks dfs and similar dp flows graphs math *2600	0 / 0	(None)
3119	CF1433D Districts Connection constructive algorithms dfs and similar *1200	0 / 0	(None)
3110	CF1436D Bandit in a City binary search dfs and similar graphs greedy trees *1900	0 / 0	(None)
3082	CF1442C Graph Transpositions dfs and similar graphs greedy shortest paths *2400	0 / 0	(None)
3078	CF1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	(None)
3070	CF1444C Team-Building data structures dfs and similar dsu graphs *2500	0 / 0	(None)
3067	CF1444E Finding the Vertex brute force dfs and similar dp interactive trees *3500	0 / 0	(None)
3059	CF1446E Long Recovery constructive algorithms dfs and similar *3500	0 / 0	(None)
3049	CF1450E Capitalism constructive algorithms dfs and similar graphs shortest paths *2700	0 / 0	(None)
3029	CF1452G Game On Tree data structures dfs and similar greedy trees *2700	0 / 0	(None)
3023	CF1453E Dog Snacks binary search dfs and similar dp greedy trees *2300	0 / 0	(None)
3017	CF1454E Number of Simple Paths combinatorics dfs and similar graphs trees *2000	0 / 0	(None)
2978	CF1463E Plan of Lectures constructive algorithms dfs and similar dsu graphs implementation sortings trees *2400	0 / 0	(None)
2970	CF1466F Euclid's nightmare bitmasks dfs and similar dsu graphs greedy math sortings *2100	0 / 0	(None)
2960	CF1467E Distinctive Roots in a Tree data structures dfs and similar dp trees *2500	0 / 0	(None)
2933	CF1470D Strange Housing constructive algorithms dfs and similar graph matchings graphs greedy *2200	0 / 0	(None)
2921	CF1472G Moving to the Capital dfs and similar dp graphs shortest paths *2100	0 / 0	(None)
2895	CF1476D Journey dfs and similar dp dsu implementation *1700	0 / 0	(None)
2894	CF1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	(None)
2887	CF1477D Nezzar and Hidden Permutations constructive algorithms dfs and similar graphs *2800	0 / 0	(None)
2851	CF1485E Move and Swap dfs and similar dp greedy trees *2500	0 / 0	(None)
2842	CF1486F Pairs of Paths combinatorics data structures dfs and similar dp trees *2600	0 / 0	(None)
2839	CF1487C Minimum Ties brute force constructive algorithms dfs and similar graphs greedy implementation math *1500	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)
2800	CF1492E Almost Fault-Tolerant Database brute force constructive algorithms dfs and similar greedy implementation *2500	0 / 0	(None)
2789	CF1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	(None)
2787	CF1494F Delete The Edges brute force constructive algorithms dfs and similar graphs implementation *2900	0 / 0	(None)
2783	CF1495D BFS Trees combinatorics dfs and similar graphs math shortest paths trees *2600	0 / 0	(None)
2766	CF1498D Bananas in a Microwave dfs and similar dp graphs implementation *2200	0 / 0	(None)
2764	CF1498F Christmas Game bitmasks data structures dfs and similar dp games math trees *2500	0 / 0	(None)
2757	CF1499F Diameter Cuts combinatorics dfs and similar dp trees *2400	0 / 0	(None)
2717	CF1508C Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees *2500	0 / 0	(None)
2715	CF1508E Tree Calendar brute force constructive algorithms data structures dfs and similar sortings trees *3100	0 / 0	(None)
2707	CF1510C Cactus Not Enough dfs and similar graph matchings graphs *2900	0 / 0	(None)
2664	CF1515F Phoenix and Earthquake constructive algorithms dfs and similar dsu graphs greedy trees *2600	0 / 0	(None)
2663	CF1515G Phoenix and Odometers dfs and similar graphs math number theory *2700	0 / 0	(None)
2652	CF1517C Fillomino 2 constructive algorithms dfs and similar greedy implementation *1400	0 / 0	(None)
2641	CF1519E Off by One constructive algorithms dfs and similar geometry graphs sortings trees *2700	0 / 0	(None)
2640	CF1519F Chests and Keys bitmasks brute force dfs and similar dp flows *3200	0 / 0	(None)
2630	CF1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *2200	0 / 0	(None)
2626	CF1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	(None)
2596	CF1527D MEX Tree combinatorics dfs and similar implementation math trees *2400	0 / 0	(None)
2594	CF1528A Parsa's Humongous Tree dfs and similar divide and conquer dp greedy trees *1600	0 / 0	(None)
2592	CF1528C Trees of Tranquillity data structures dfs and similar greedy trees *2300	0 / 0	(None)
2563	CF1533G Biome Map *special problem constructive algorithms dfs and similar graphs	0 / 0	(None)
2561	CF1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(None)
2553	CF1534F1 Falling Sand (Easy Version) dfs and similar graphs greedy *2500	0 / 0	(None)
2552	CF1534F2 Falling Sand (Hard Version) dfs and similar dp graphs greedy *3000	0 / 0	(None)
2545	CF1535D Playoff Tournament data structures dfs and similar dp implementation trees *1800	0 / 0	(None)
2529	CF1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	(None)
2494	CF1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *1900	0 / 0	(None)
2473	CF1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	(None)
2464	CF1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	(None)
2449	CF1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	(None)
2444	CF1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	(None)
2441	CF1552G A Serious Referee bitmasks brute force dfs and similar sortings *3000	0 / 0	(None)
2439	CF1552I Organizing a Music Festival dfs and similar math *3400	0 / 0	(None)
2433	CF1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	(None)
2423	CF1554E You dfs and similar dp math number theory *2600	0 / 0	(None)
2396	CF1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(None)
2389	CF1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	(None)
2382	CF1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	(None)
2381	CF1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(None)
2363	CF1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	(None)
2353	CF1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	(None)
2347	CF1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	0 / 0	(None)
2322	CF1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	(None)
2320	CF1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	(None)
2316	CF1575D Divisible by Twenty-Five brute force dfs and similar dp *1800	0 / 0	(None)
2293	CF1578J Just Kingdom brute force data structures dfs and similar *3100	0 / 0	(None)
2258	CF1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	(None)
2241	CF1585E Frequency Queries data structures dfs and similar trees *2400	0 / 0	(None)
2233	CF1592C Bakry and Partitioning bitmasks constructive algorithms dfs and similar dp graphs trees *1700	0 / 0	(None)
2232	CF1592D Hemose in ICPC ? binary search dfs and similar implementation interactive math number theory trees *2300	0 / 0	(None)
2227	CF1593B Make it Divisible by 25 dfs and similar dp greedy math math *900	0 / 0	(None)
2222	CF1593E Gardener and Tree brute force data structures dfs and similar greedy implementation trees *1600	0 / 0	(None)
2221	CF1593F Red-Black Number dfs and similar dp implementation math meet-in-the-middle *2100	0 / 0	(None)
2216	CF1594D The Number of Imposters constructive algorithms dfs and similar dp dsu graphs *1700	0 / 0	(None)
2211	CF1598A Computer Game brute force dfs and similar dp implementation *800	0 / 0	(None)
2207	CF1598E Staircases brute force combinatorics data structures dfs and similar dp implementation math *2100	0 / 0	(None)
2189	CF1600J Robot Factory bitmasks dfs and similar *1400	0 / 0	(None)
2187	CF1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *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