Problems Playground
Login
Min rating
Max rating
Tag
Reset
# Problem Tags Rating Solved
1562-A The Miracle and the Sleeper
greedy math
800
1561-D1 Up the Strip (simplified version)
brute force data structures dp +2
1700
1561-C Deep Down Below
binary search greedy sortings
1300
1561-A Simply Strange Sort
brute force implementation sortings
800
1560-F2 Nearest Beautiful Number (hard version)
bitmasks brute force constructive algorithms +3
2100
1560-F1 Nearest Beautiful Number (easy version)
binary search bitmasks brute force +3
1900
1560-E Polycarp and String Transformation
binary search implementation sortings +1
1800
1560-D Make a Power of Two
greedy math strings
1300
1560-C Infinity Table
implementation math
800
1560-B Who's Opposite?
math
800
1560-A Dislike of Threes
implementation
800
1559-E Mocha and Stars
combinatorics dp fft +2
2200
1559-D2 Mocha and Diana (Hard Version)
brute force constructive algorithms dfs and similar +5
2500
1559-D1 Mocha and Diana (Easy Version)
brute force constructive algorithms dsu +3
1400
1559-C Mocha and Hiking
constructive algorithms graphs
1200
1559-B Mocha and Red and Blue
dp greedy
900
1559-A Mocha and Math
bitmasks constructive algorithms math
900
1558-F Strange Sort
data structures sortings
3300
1558-E Down Below
binary search dfs and similar graphs +3
3000
1558-D Top-Notch Insertions
combinatorics data structures
2600
1558-C Bottom-Tier Reversals
constructive algorithms greedy
2000
1558-B Up the Strip
brute force dp math +2
1900
1558-A Charmed by the Game
brute force math
1300
1557-E Assiut Chess
brute force constructive algorithms interactive
2800
1557-D Ezzat and Grid
data structures dp greedy
2200
1557-C Moamen and XOR
bitmasks combinatorics dp +2
1700
1557-B Moamen and k-subarrays
greedy sortings
1100
1557-A Ezzat and Two Subsequences
brute force math sortings
800
1556-H DIY Tree
graphs greedy math +1
3300
1556-G Gates to Another World
bitmasks data structures dsu +1
3300
1556-F Sports Betting
bitmasks combinatorics dp +3
2500
1556-E Equilibrium
data structures dp greedy
2200
1556-D Take a Guess
bitmasks constructive algorithms interactive +1
1800
1556-C Compressed Bracket Sequence
brute force implementation
1800
1556-B Take Your Places!
implementation
1300
1556-A A Variety of Operations
math
800
1555-F Good Graph
data structures dsu graphs +1
2700
1555-E Boring Segments
data structures sortings trees +1
2100
1555-D Say No to Palindromes
brute force constructive algorithms dp +1
1600
1555-C Coin Rows
brute force constructive algorithms dp +1
1300
1555-B Two Tables
brute force
1300
1555-A PizzaForces
brute force math
900
1554-E You
dfs and similar dp math +1
2600
1554-D Diane
constructive algorithms greedy strings
1800
1554-C Mikasa
binary search bitmasks greedy +1
1800
1554-B Cobb
bitmasks brute force greedy +1
1700
1554-A Cherry
greedy
800
1553-I Stairs
combinatorics divide and conquer dp +2
3400
1553-H XOR and Distance
bitmasks divide and conquer trees
2900
1553-G Common Divisor Graph
brute force constructive algorithms dsu +4
2700