Problems Playground
Login
Min rating
Max rating
Tag
Reset
# Problem Tags Rating Solved
1984-F Reconstruction
brute force dp math
2500
1984-E Shuffle
dp greedy trees
2400
1984-D ''a'' String Problem
brute force hashing implementation +3
2000
1984-C2 Magnitude (Hard Version)
combinatorics dp greedy +1
1700
1984-C1 Magnitude (Easy Version)
dp greedy math
1300
1984-B Large Addition
implementation math
1100
1984-A Strange Splitting
constructive algorithms
800
1983-G Your Loss
bitmasks brute force dp +1
3000
1983-F array-value
binary search bitmasks data structures +2
2500
1983-E I Love Balls
combinatorics math probabilities
2300
1983-D Swap Dilemma
constructive algorithms data structures divide and conquer +3
1700
1983-C Have Your Cake and Eat It Too
binary search brute force greedy +1
1400
1983-B Corner Twist
constructive algorithms greedy implementation +1
1200
1983-A Array Divisibility
constructive algorithms math
800
1982-F Sorting Problem Again
binary search data structures sortings
2600
1982-E Number of k-good subarrays
bitmasks brute force combinatorics +4
2300
1982-D Beauty of the mountains
brute force data structures implementation +2
1700
1982-C Boring Day
binary search data structures dp +2
1200
1982-B Collatz Conjecture
brute force implementation math +1
1200
1982-A Soccer
greedy implementation math +1
800
1981-F Turtle and Paths on a Tree
data structures dp trees
3000
1981-E Turtle and Intersected Segments
data structures dsu graphs +1
2600
1981-D Turtle and Multiplication
constructive algorithms dfs and similar graphs +1
2400
1981-C Turtle and an Incomplete Sequence
bitmasks brute force constructive algorithms +3
1800
1981-B Turtle and an Infinite Sequence
bitmasks math
1300
1981-A Turtle and Piggy Are Playing a Game
brute force greedy math
800
1980-G Yasya and the Mysterious Tree
bitmasks data structures dfs and similar +4
2300
1980-F2 Field Division (hard version)
math sortings
2400
1980-F1 Field Division (easy version)
data structures math sortings
1900
1980-E Permutation of Rows and Columns
constructive algorithms data structures greedy +5
1600
1980-D GCD-sequence
greedy implementation math +1
1400
1980-C Sofia and the Lost Operations
constructive algorithms greedy
1300
1980-B Choosing Cubes
sortings
800
1980-A Problem Generator
math
800
1979-F Kostyanych's Theorem
brute force constructive algorithms graphs +1
2900
1979-E Manhattan Triangle
binary search constructive algorithms data structures +3
2400
1979-D Fixing a Binary String
bitmasks brute force constructive algorithms +4
1800
1979-C Earning on Bets
binary search combinatorics constructive algorithms +1
1200
1979-B XOR Sequences
bitmasks greedy
1000
1979-A Guess the Maximum
brute force greedy implementation
800
1978-F Large Graph
data structures dfs and similar dsu +3
2400
1978-E Computing Machine
brute force data structures dp +2
2000
1978-D Elections
data structures greedy implementation +1
1600
1978-C Manhattan Permutations
constructive algorithms data structures greedy +2
1300
1978-B New Bakery
binary search greedy math +1
800
1978-A Alice and Books
constructive algorithms greedy sortings
800
1977-E Tensor
constructive algorithms graphs interactive
2600
1977-D XORificator
bitmasks brute force greedy +1
2300
1977-C Nikita and LCM
brute force data structures dp +4
1900
1977-B Binary Colouring
bitmasks constructive algorithms greedy +1
1100