Problems Playground
Login
Min rating
Max rating
Tag
Reset
# Problem Tags Rating Solved
1571-J Two Railroads
*special
3000
1571-I Physical Examination
*special binary search data structures
3200
1571-H Laser Beams
*special geometry probabilities
2900
1571-G A Battle Against a Dragon
*special data structures dp
2500
1571-F Kotlinforces
*special constructive algorithms dp
2000
1571-E Fix the String
*special bitmasks dp +1
1700
1571-D Sweepstake
*special brute force constructive algorithms +2
1800
1571-C Rhyme
*special implementation
1800
1571-B Epic Novel
*special math
1300
1571-A Sequence of Comparisons
*special
800
1569-F Palindromic Hamiltonian Path
brute force dfs and similar dp +2
3000
1569-E Playoff Restoration
bitmasks brute force hashing +2
2600
1569-D Inconvenient Pairs
binary search data structures implementation +2
1900
1569-C Jury Meeting
combinatorics math
1500
1569-B Chess Tournament
constructive algorithms
1000
1569-A Balanced Substring
implementation
800
1567-F One-Four Overload
2-sat constructive algorithms dfs and similar +3
2700
1567-E Non-Decreasing Dilemma
data structures divide and conquer math
2200
1567-D Expression Evaluation Error
constructive algorithms greedy implementation +1
2000
1567-C Carrying Conundrum
bitmasks combinatorics dp +1
1600
1567-B MEXor Mixup
bitmasks greedy
1000
1567-A Domino Disaster
implementation strings
800
1566-H Xor-quiz
constructive algorithms dp interactive +2
3200
1566-G Four Vertices
constructive algorithms data structures graphs +3
3100
1566-F Points Movement
data structures dp greedy +2
2600
1566-E Buds Re-hanging
constructive algorithms dfs and similar dp +2
2000
1566-D2 Seating Arrangements (hard version)
data structures greedy implementation +2
1600
1566-D1 Seating Arrangements (easy version)
data structures greedy sortings
1100
1566-C MAX-MEX Cut
bitmasks constructive algorithms dp +1
1000
1566-B MIN-MEX Cut
bitmasks constructive algorithms dp +1
800
1566-A Median Maximization
binary search greedy math
800
1562-F Tubular Bells
interactive math number theory +1
2900
1562-E Rescue Niwen!
dp greedy string suffix structures +1
2500
1562-D2 Two Hundred Twenty One (hard version)
data structures math
2200
1562-D1 Two Hundred Twenty One (easy version)
data structures dp math
1700
1562-C Rings
constructive algorithms math
1500
1562-B Scenes From a Memory
brute force constructive algorithms implementation +2
1000
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