greedy - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
2166	CF1605E Array Equalizer binary search greedy implementation math number theory sortings two pointers *2400	0 / 0	(None)
2163	CF1606B Update Files greedy implementation math *1100	0 / 0	(None)
2162	CF1606C Banknotes greedy number theory *1400	0 / 0	(None)
2154	CF1607D Blue-Red Permutation greedy math sortings *1300	0 / 0	(None)
2151	CF1607G Banquet Preparations 1 greedy *2200	0 / 0	(None)
2150	CF1607H Banquet Preparations 2 greedy sortings two pointers *2200	0 / 0	(None)
2148	CF1608B Build the Permutation constructive algorithms greedy *1200	0 / 0	(None)
2147	CF1608C Game Master data structures dfs and similar dp graphs greedy two pointers *1700	0 / 0	(None)
2141	CF1609A Divide and Multiply greedy implementation math number theory *900	0 / 0	(None)
2138	CF1609D Social Network dsu graphs greedy implementation trees *1600	0 / 0	(None)
2134	CF1609G A Stroll Around the Matrix data structures greedy math *3000	0 / 0	(None)
2131	CF1610B Kalindrome Array greedy two pointers *1100	0 / 0	(None)
2130	CF1610C Keshi Is Throwing a Party binary search greedy *1600	0 / 0	(None)
2128	CF1610E AmShZ and G.O.A.T. binary search brute force greedy implementation math *2300	0 / 0	(None)
2126	CF1610G AmShZ Wins a Bet data structures greedy hashing *3300	0 / 0	(None)
2125	CF1610H Squid Game data structures dfs and similar greedy trees *3100	0 / 0	(None)
2118	CF1611E1 Escape The Maze (easy version) dfs and similar greedy shortest paths trees two pointers *1700	0 / 0	(None)
2117	CF1611E2 Escape The Maze (hard version) dfs and similar dp greedy shortest paths trees *1900	0 / 0	(None)
2115	CF1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	(None)
2112	CF1612B Special Permutation constructive algorithms greedy *900	0 / 0	(None)
2109	CF1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	(None)
2108	CF1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	(None)
2107	CF1612G Max Sum Array combinatorics constructive algorithms greedy sortings *2500	0 / 0	(None)
2105	CF1613B Absent Remainder greedy implementation sortings *1000	0 / 0	(None)
2099	CF1614A Divan and a Store brute force constructive algorithms greedy *800	0 / 0	(None)
2093	CF1615A Closing The Gap greedy math *800	0 / 0	(None)
2092	CF1615B And It's Non-Zero bitmasks greedy math *1300	0 / 0	(None)
2090	CF1615C Menorah brute force graphs greedy math *1600	0 / 0	(None)
2088	CF1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	(None)
2083	CF1616B Mirror in the String greedy strings *1100	0 / 0	(None)
2081	CF1616D Keep the Average High dp greedy math *2000	0 / 0	(None)
2078	CF1616E Lexicographically Small Enough brute force data structures greedy strings *2200	0 / 0	(None)
2074	CF1617A Forbidden Subsequence constructive algorithms greedy sortings strings *800	0 / 0	(None)
2072	CF1617C Paprika and Permutation binary search greedy math sortings *1300	0 / 0	(None)
2064	CF1618D Array and Operations dp greedy math *1300	0 / 0	(None)
2061	CF1618G Trader Problem data structures dsu greedy sortings *2200	0 / 0	(None)
2056	CF1619D New Year's Problem binary search greedy sortings *1800	0 / 0	(None)
2055	CF1619E MEX and Increments constructive algorithms data structures dp greedy implementation math sortings *1700	0 / 0	(None)
2054	CF1619F Let's Play the Hat? brute force constructive algorithms greedy math *2000	0 / 0	(None)
2053	CF1619G Unusual Minesweeper binary search dfs and similar dsu greedy sortings *2000	0 / 0	(None)
2050	CF1620B Triangles on a Rectangle geometry greedy math *1000	0 / 0	(None)
2049	CF1620C BA-String brute force dp greedy implementation math *1800	0 / 0	(None)
2048	CF1620D Exact Change brute force constructive algorithms greedy *2000	0 / 0	(None)
2045	CF1620F Bipartite Array dp greedy *2800	0 / 0	(None)
2042	CF1621B Integers Shop data structures greedy implementation *1500	0 / 0	(None)
2040	CF1621D The Winter Hike constructive algorithms greedy math *2100	0 / 0	(None)
2039	CF1621E New School binary search data structures dp greedy implementation sortings *2300	0 / 0	(None)
2038	CF1621F Strange Instructions data structures greedy implementation *2700	0 / 0	(None)
2032	CF1622B Berland Music data structures greedy math sortings *1000	0 / 0	(None)
2031	CF1622C Set or Decrease binary search brute force greedy sortings *1600	0 / 0	(None)
2029	CF1622E Math Test bitmasks brute force greedy *2200	0 / 0	(None)
2025	CF1623C Balanced Stone Heaps binary search greedy *1600	0 / 0	(None)
2022	CF1623E Middle Duplication data structures dfs and similar greedy strings trees *2500	0 / 0	(None)
2019	CF1624C Division by Two and Permutation constructive algorithms flows graph matchings greedy math *1100	0 / 0	(None)
2018	CF1624D Palindromes Coloring binary search greedy sortings strings *1400	0 / 0	(None)
2015	CF1624G MinOr Tree bitmasks dfs and similar dsu graphs greedy *1900	0 / 0	(None)
2014	CF1625A Ancient Civilization bitmasks greedy math *800	0 / 0	(None)
2012	CF1625B Elementary Particles brute force greedy sortings *1100	0 / 0	(None)
2006	CF1626B Minor Reduction greedy strings *1100	0 / 0	(None)
2005	CF1626C Monsters And Spells binary search data structures dp greedy implementation math two pointers *1700	0 / 0	(None)
2004	CF1626D Martial Arts Tournament binary search brute force greedy math *2100	0 / 0	(None)
2003	CF1626E Black and White Tree dfs and similar greedy trees *2400	0 / 0	(None)
1999	CF1627B Not Sitting games greedy sortings *1300	0 / 0	(None)
1995	CF1627F Not Splitting geometry graphs greedy implementation shortest paths *2700	0 / 0	(None)
1994	CF1628A Meximum Array binary search constructive algorithms greedy implementation math two pointers *1400	0 / 0	(None)
1993	CF1628B Peculiar Movie Preferences greedy strings *1700	0 / 0	(None)
1992	CF1628C Grid Xor constructive algorithms greedy implementation interactive math *2300	0 / 0	(None)
1986	CF1629A Download More RAM brute force greedy sortings *800	0 / 0	(None)
1985	CF1629B GCD Arrays greedy math number theory *800	0 / 0	(None)
1983	CF1630B Range and Partition binary search constructive algorithms data structures greedy two pointers *1800	0 / 0	(None)
1982	CF1630C Paint the Middle dp greedy sortings two pointers *2200	0 / 0	(None)
1981	CF1630D Flipping Range constructive algorithms dp greedy number theory *2400	0 / 0	(None)
1977	CF1631A Min Max Swap greedy *800	0 / 0	(None)
1976	CF1631B Fun with Even Subarrays dp greedy *1100	0 / 0	(None)
1972	CF1632D New Year Concert binary search data structures greedy math number theory two pointers *2000	0 / 0	(None)
1966	CF1633B Minority greedy *800	0 / 0	(None)
1964	CF1633D Make Them Equal dp greedy *1600	0 / 0	(None)
1963	CF1633E Spanning Tree Queries binary search data structures dfs and similar dsu graphs greedy math sortings trees *2400	0 / 0	(None)
1961	CF1634A Reverse and Concatenate greedy strings *800	0 / 0	(None)
1954	CF1635A Min Or Sum bitmasks greedy *800	0 / 0	(None)
1953	CF1635B Avoid Local Maximums greedy *800	0 / 0	(None)
1952	CF1635C Differential Sorting constructive algorithms greedy *1200	0 / 0	(None)
1950	CF1635E Cars 2-sat constructive algorithms dfs and similar dsu graphs greedy sortings *2200	0 / 0	(None)
1949	CF1635F Closest Pair data structures greedy *2800	0 / 0	(None)
1947	CF1637B MEX and Array brute force dp greedy math *1100	0 / 0	(None)
1945	CF1637C Andrew and Stones greedy implementation *1200	0 / 0	(None)
1944	CF1637D Yet Another Minimization Problem dp greedy math *1800	0 / 0	(None)
1942	CF1637F Towers constructive algorithms dfs and similar dp greedy trees *2500	0 / 0	(None)
1941	CF1637G Birthday constructive algorithms greedy math *3000	0 / 0	(None)
1940	CF1637H Minimize Inversions Number data structures greedy math sortings *3500	0 / 0	(None)
1939	CF1638A Reverse constructive algorithms greedy math *800	0 / 0	(None)
1936	CF1638D Big Brush constructive algorithms data structures greedy implementation *2000	0 / 0	(None)
1933	CF1638F Two Posters brute force data structures greedy two pointers *3200	0 / 0	(None)
1920	CF1641A Great Sequence brute force greedy sortings *1200	0 / 0	(None)
1918	CF1641C Anonymity Is Important binary search brute force data structures dsu greedy sortings *2200	0 / 0	(None)
1917	CF1641D Two Arrays bitmasks brute force combinatorics greedy hashing math two pointers *2700	0 / 0	(None)
1912	CF1642B Power Walking greedy *900	0 / 0	(None)
1909	CF1644C Increase Subarray Sums brute force dp greedy implementation *1400	0 / 0	(None)
1904	CF1646B Quality vs Quantity brute force constructive algorithms greedy sortings two pointers *800	0 / 0	(None)
1899	CF1646F Playing Around the Table constructive algorithms greedy implementation *2900	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