Problems Playground
Login
Min rating
Max rating
Tag
Reset
# Problem Tags Rating Solved
2182-A New Year String
constructive algorithms greedy implementation +1
800
2181-M Medical Parity
dp strings
1700
2181-L LLM Training
math string suffix structures
2800
2181-K Knit the Grid
2-sat constructive algorithms graphs +1
3500
2181-J Jinx or Jackpot
brute force dp math +1
2300
2181-I Irrigation Interlock
geometry
3500
2181-H Honey Cake
brute force math number theory
1200
2181-G Greta's Game
binary search dp graphs +2
2400
2181-F Fragmented Nim
games
1600
2181-E Elevator Against Humanity
brute force constructive algorithms greedy +1
2900
2181-D Doorway
binary search data structures sortings
2000
2181-C Cacti Classification
binary search constructive algorithms interactive +1
3200
2181-B Battle of Arrays
data structures games greedy
1400
2181-A Alphabet City
binary search math strings
1300
2180-H2 Bug Is Feature (Conditional Version)
games
3500
2180-H1 Bug Is Feature (Unconditional Version)
games
3400
2180-G Balance
bitmasks combinatorics implementation +1
3500
2180-F2 Control Car (Hard Version)
combinatorics dp matrices +1
3200
2180-F1 Control Car (Easy Version)
combinatorics dp probabilities
2800
2180-E No Effect XOR
bitmasks divide and conquer dp +2
2300
2180-D Insolvable Disks
data structures dp greedy +1
1900
2180-C XOR-factorization
bitmasks constructive algorithms dp +2
1900
2180-B Ashmal
greedy strings
800
2180-A Carnival Wheel
brute force number theory
800
2179-H Blackslex and Plants
bitmasks data structures dp +2
2200
2179-G Blackslex and Penguin Migration
brute force interactive math
2200
2179-F Blackslex and Another RGB Walking
communication constructive algorithms graphs +3
2000
2179-E Blackslex and Girls
constructive algorithms geometry math
1800
2179-D Blackslex and Penguin Civilization
bitmasks constructive algorithms greedy +1
1300
2179-C Blackslex and Number Theory
implementation math number theory +1
1100
2179-B Blackslex and Showering
dp greedy implementation
800
2179-A Blackslex and Password
math strings
800
2178-I Numbers or Fireworks
bitmasks combinatorics dp +1
3300
2178-H Create or Duplicate
bitmasks graphs number theory +1
3300
2178-G deCH OR Dations
bitmasks data structures dp +2
2800
2178-F Conquer or of Forest
combinatorics math trees
2200
2178-E Flatten or Concatenate
binary search divide and conquer interactive
2000
2178-D Xmas or Hysteria
constructive algorithms greedy implementation +1
1700
2178-C First or Second
dp greedy implementation
1200
2178-B Impost or Sus
dp greedy implementation +1
900
2178-A Yes or Yes
greedy strings
800
2176-F Omega Numbers
bitmasks combinatorics dp +2
2400
2176-E Remove at the lowest cost
data structures dfs and similar dp +4
2400
2176-D Fibonacci Paths
data structures dp graphs +1
1800
2176-C Odd Process
greedy sortings
1300
2176-B Optimal Shifts
bitmasks greedy strings
1000
2176-A Operations with Inversions
greedy implementation math
800
2175-B XOR Array
constructive algorithms math
1300
2175-A Little Fairy's Painting
implementation
800
2174-F Mosaic Tree
combinatorics dp fft +2
2800