Problems Playground
Login
Min rating
Max rating
Tag
Reset
# Problem Tags Rating Solved
1977-A Little Nikita
math
800
1976-F Remove Bridges
data structures dfs and similar dp +3
2800
1976-E Splittable Permutations
combinatorics data structures dfs and similar +3
2500
1976-D Invertible Bracket Sequences
binary search combinatorics data structures +3
2000
1976-C Job Interview
binary search dp greedy +2
1600
1976-B Increase/Decrease/Copy
greedy implementation
1100
1976-A Verify Password
implementation sortings strings
800
1975-I Mind Bloom
dp
3500
1975-H 378QAQ and Core
greedy strings
3500
1975-G Zimpha Fan Club
fft greedy math +1
3000
1975-F Set
bitmasks brute force combinatorics +4
2600
1975-E Chain Queries
binary search data structures dfs and similar +2
2100
1975-D Paint the Tree
brute force dfs and similar dp +3
1700
1975-C Chamo and Mocha's Array
binary search brute force greedy
1200
1975-B 378QAQ and Mocha's Array
brute force greedy math +1
1000
1975-A Bazoka and Mocha's Array
brute force greedy implementation +1
800
1974-G Money Buys Less Happiness Now
data structures greedy sortings
2000
1974-F Cutting Game
binary search brute force data structures +3
1900
1974-E Money Buys Happiness
dp
1800
1974-D Ingenuity-2
constructive algorithms greedy implementation
1400
1974-C Beautiful Triple Pairs
combinatorics data structures
1400
1974-B Symmetric Encoding
implementation sortings strings
800
1974-A Phone Desktop
greedy math
800
1973-F Maximum GCD Sum Queries
bitmasks brute force dp +2
3100
1973-E Cat, Fox and Swaps
graphs math sortings
2500
1973-D Cat, Fox and Maximum Array Split
brute force interactive math
2400
1973-C Cat, Fox and Double Maximum
constructive algorithms greedy implementation +2
1700
1973-B Cat, Fox and the Lonely Array
binary search bitmasks data structures +3
1300
1973-A Chess For Three
brute force dp implementation +1
900
1972-B Coin Games
games
900
1972-A Contest Proposal
brute force greedy two pointers
800
1971-H ±1
2-sat dfs and similar graphs
2100
1971-G XOUR
data structures dsu sortings
1700
1971-F Circle Perimeter
binary search brute force dfs and similar +3
1600
1971-E Find the Car
binary search math sortings
1500
1971-D Binary Cut
dp greedy implementation +2
1100
1971-C Clock and Strings
implementation
900
1971-B Different String
implementation strings
800
1971-A My First Sorting Problem
implementation sortings
800
1970-G3 Min-Fund Prison (Hard)
bitmasks dfs and similar dp +2
2400
1970-G2 Min-Fund Prison (Medium)
brute force dfs and similar dp +2
2200
1970-G1 Min-Fund Prison (Easy)
dfs and similar trees
1900
1970-F3 Playing Quidditch (Hard)
implementation
2300
1970-F2 Playing Quidditch (Medium)
implementation
2300
1970-F1 Playing Quidditch (Easy)
implementation
2300
1970-E3 Trails (Hard)
dp matrices
2200
1970-E2 Trails (Medium)
dp matrices
2000
1970-E1 Trails (Easy)
dp
1800
1970-D3 Arithmancy (Hard)
interactive
3100
1970-D2 Arithmancy (Medium)
constructive algorithms interactive probabilities +1
2600