DIV.2
Div. 2, Problem D
List of random Codeforces problems, all of them are Div. 2 D problems. The problems are sorted, the most solved problem comes first. This is a good practice for whoever can solve almost all Div. 2 A, B and C problems, but might have some difficulties while solving the C problems.
PROBLEM TYPE D
PROBLEMS 100
PROGRESS
Your Statistics
SOLVED
COMPLETION 0 / 100
PROBLEM SET
All Problems
SHOW/HIDE
RATING RANGE
—
SORT BY RATING
FILTER BY TAG
| # | PROBLEM | RATING | DIFFICULTY | TAGS | STATUS |
|---|---|---|---|---|---|
| 01 | Flowers | LVL 1 | dp | | |
| 02 | Prizes, Prizes, more Prizes | LVL 3 | implementation | | |
| 03 | Xenia and Bit Operations | LVL 4 | data structurestrees | | |
| 04 | Vasya and Chess | LVL 4 | constructive algorithmsgamesmath | | |
| 05 | Mashmokh and ACM | LVL 3 | combinatoricsdpnumber theory | | |
| 06 | Multiplication Table | LVL 5 | binary searchbrute force | | |
| 07 | Unbearable Controversy of Being | LVL 3 | brute forcecombinatoricsdfs and similar +1 | | |
| 08 | Caesar's Legions | LVL 4 | dp | | |
| 09 | Colorful Graph | LVL 4 | brute forcedfs and similargraphs | | |
| 10 | Little Girl and Maximum XOR | LVL 4 | bitmasksdpgreedy +2 | | |
| 11 | Common Divisors | LVL 4 | brute forcehashingimplementation +2 | | |
| 12 | Magic Box | LVL 4 | brute forcegeometry | | |
| 13 | Good Sequences | LVL 4 | dpnumber theory | | |
| 14 | Password | LVL 4 | binary searchdphashing +2 | | |
| 15 | Greg and Graph | LVL 4 | dpgraphsshortest paths | | |
| 16 | Working out | LVL 4 | dp | | |
| 17 | Count Good Substrings | LVL 5 | math | | |
| 18 | Good Substrings | LVL 5 | data structuresstrings | | |
| 19 | Long Path | LVL 4 | dpimplementation | | |
| 20 | Maximum Value | LVL 5 | binary searchmathsortings +1 | | |
| 21 | Greenhouse Effect | LVL 4 | dp | | |
| 22 | Red-Green Towers | LVL 5 | dp | | |
| 23 | Maximum Submatrix 2 | LVL 4 | data structuresdpimplementation +1 | | |
| 24 | Cow Program | LVL 4 | dfs and similardpgraphs | | |
| 25 | Biridian Forest | LVL 4 | dfs and similarshortest paths | | |
| 26 | Andrey and Problem | LVL 4 | greedymathprobabilities | | |
| 27 | DZY Loves Modification | LVL 5 | brute forcedata structuresgreedy | | |
| 28 | Zero Tree | LVL 4 | dfs and similardpgreedy +1 | | |
| 29 | Prefixes and Suffixes | LVL 5 | dpstring suffix structuresstrings +1 | | |
| 30 | Queue | LVL 4 | binary searchdata structures | | |
| 31 | Chips | LVL 4 | greedy | | |
| 32 | Valid Sets | LVL 5 | dfs and similardpmath +1 | | |
| 33 | Pair of Numbers | LVL 5 | binary searchbrute forcedata structures +2 | | |
| 34 | Planets | LVL 4 | binary searchdata structuresgraphs +1 | | |
| 35 | Queue | LVL 5 | constructive algorithmsdp | | |
| 36 | Petya and Divisors | LVL 4 | binary searchdata structuresnumber theory | | |
| 37 | Obsessive String | LVL 5 | dpstrings | | |
| 38 | Dima and Bacteria | LVL 5 | dsugraphsshortest paths | | |
| 39 | Psychos in a Line | LVL 4 | data structuresimplementation | | |
| 40 | Ciel and Duel | LVL 5 | dpflowsgreedy | | |
| 41 | Falling Anvils | LVL 4 | mathprobabilities | | |
| 42 | Hit Ball | LVL 4 | geometryimplementationmath | | |
| 43 | Toy Sum | LVL 4 | greedyimplementationmath | | |
| 44 | Lucky Common Subsequence | LVL 5 | dpstrings | | |
| 45 | Two Paths | LVL 5 | dfs and similardpgraphs +3 | | |
| 46 | Help General | LVL 4 | constructive algorithmsgreedyimplementation | | |
| 47 | Dima and Two Sequences | LVL 4 | combinatoricsmathsortings | | |
| 48 | How many trees? | LVL 5 | combinatoricsdivide and conquerdp | | |
| 49 | Lucky Number 2 | LVL 5 | constructive algorithms | | |
| 50 | Cinema | LVL 6 | implementation | | |
| 51 | Wizards and Huge Prize | LVL 5 | dpmathprobabilities | | |
| 52 | Apple Tree | LVL 5 | dfs and similarnumber theorytrees | | |
| 53 | Yaroslav and Time | LVL 5 | binary searchgraphsshortest paths | | |
| 54 | Numbers | LVL 5 | combinatoricsdp | | |
| 55 | Treasure Island | LVL 4 | brute forceimplementation | | |
| 56 | Book of Evil | LVL 5 | dfs and similardivide and conquerdp +1 | | |
| 57 | Sereja and Periods | LVL 5 | binary searchdfs and similarstrings | | |
| 58 | Infinite Maze | LVL 5 | dfs and similargraphs | | |
| 59 | Playing with Permutations | LVL 5 | implementationmath | | |
| 60 | Doctor | LVL 4 | binary searchmathsortings | | |
| 61 | Animals | LVL 4 | dpgreedy | | |
| 62 | Mushroom Scientists | LVL 4 | mathternary search | | |
| 63 | Tennis Game | LVL 4 | binary search | | |
| 64 | Buses | LVL 4 | binary searchdata structuresdp | | |
| 65 | String | LVL 5 | brute forceconstructive algorithmshashing +3 | | |
| 66 | Shifting | LVL 5 | implementation | | |
| 67 | Boring Partition | LVL 4 | constructive algorithms | | |
| 68 | Analyzing Polyline | LVL 5 | geometrymathsortings | | |
| 69 | Vasya and Types | LVL 4 | implementationstrings | | |
| 70 | Lizards and Basements 2 | LVL 6 | brute forcedp | | |
| 71 | Constellation | LVL 5 | implementation | | |
| 72 | Pawn | LVL 5 | dp | | |
| 73 | Journey | LVL 5 | brute forceconstructive algorithmsimplementation | | |
| 74 | Tanya and Password | LVL 7 | dfs and similargraphs | | |
| 75 | Demonstration | LVL 4 | greedy | | |
| 76 | Big Maximum Sum | LVL 5 | data structuresdpgreedy +3 | | |
| 77 | The Child and Zoo | LVL 4 | dsusortings | | |
| 78 | Mr. Bender and Square | LVL 4 | binary searchimplementationmath | | |
| 79 | Special Grid | LVL 5 | brute forcedpgreedy | | |
| 80 | Name That Tune | LVL 6 | dpprobabilitiestwo pointers | | |
| 81 | Ring Road 2 | LVL 5 | 2-satdfs and similardsu +1 | | |
| 82 | Russian Roulette | LVL 5 | constructive algorithmsgreedy | | |
| 83 | Snake | LVL 6 | bitmasksdfs and similargraphs +1 | | |
| 84 | Upgrading Array | LVL 5 | dpgreedymath +1 | | |
| 85 | Edges in MST | LVL 6 | dfs and similardsugraphs +1 | | |
| 86 | Fools and Foolproof Roads | LVL 6 | data structuresdfs and similardsu +2 | | |
| 87 | End of Exams | LVL 5 | greedy | | |
| 88 | Restoring Numbers | LVL 7 | constructive algorithmsmath | | |
| 89 | Cats Transport | LVL 7 | data structuresdp | | |
| 90 | Broken Monitor | LVL 5 | brute forceconstructive algorithmsgreedy +1 | | |
| 91 | The Minimum Number of Variables | LVL 6 | bitmasksdp | | |
| 92 | Volcanoes | LVL 7 | binary searchimplementationsortings +1 | | |
| 93 | Widget Library | LVL 5 | dpexpression parsinggraphs +1 | | |
| 94 | Misha and Permutations Summation | LVL 4 | data structures | | |
| 95 | BerDonalds | LVL 7 | graphsmathshortest paths | | |
| 96 | Tower of Hanoi | LVL 8 | dp | | |
| 97 | Mr. Kitayuta's Technology | LVL 5 | dfs and similar | | |
| 98 | Shoe Store | LVL 7 | dpgraph matchingsgreedy +2 | | |
| 99 | Inna and Sweet Matrix | LVL 8 | constructive algorithms | | |
| 100 | Help King | LVL 9 | implementationprobabilitiestrees | |
ANALYTICS
Quick Stats
≤ SPECIALIST
8
PROBLEMS EXPERT
41
PROBLEMS CANDIDATE MASTER
28
PROBLEMS ≥ MASTER
23
PROBLEMS