Problems Playground
Login
Min rating
Max rating
Tag
Reset
# Problem Tags Rating Solved
203-C Photographer
greedy sortings
1400
203-B Game on Paper
brute force implementation
1300
203-A Two Problems
brute force implementation
1200
202-B Brand New Easy Problem
brute force
1700
202-A LLPS
binary search bitmasks brute force +3
800
201-E Thoroughly Bureaucratic Organization
binary search combinatorics
2600
201-D Brand New Problem
bitmasks brute force dp
2600
201-C Fragile Bridges
dp
2000
201-B Guess That Car!
math ternary search
1800
201-A Clear Symmetry
constructive algorithms dp math
1700
200-E Tractor College
implementation math number theory +1
2400
200-D Programming Language
binary search brute force expression parsing +1
1800
200-C Football Championship
brute force implementation
1800
200-B Drinks
implementation math
800
200-A Cinema
brute force data structures
2400
199-B Special Olympics
geometry
1900
199-A Hexadecimal's theorem
brute force constructive algorithms implementation +1
900
198-E Gripping Story
binary search data structures sortings
2400
198-D Cube Snake
constructive algorithms
2700
198-C Delivering Carcinogen
binary search geometry
2400
198-B Jumping on Walls
shortest paths
1400
198-A About Bacteria
implementation math
1700
197-B Limit
math
1400
197-A Plate Game
constructive algorithms games math
1600
196-E Opening Portals
dsu graphs shortest paths
2600
196-D The Next Good String
data structures greedy hashing +1
2800
196-C Paint Tree
constructive algorithms divide and conquer geometry +2
2200
196-B Infinite Maze
dfs and similar graphs
2000
196-A Lexicographically Maximum Subsequence
greedy strings
1100
195-E Building Forest
data structures dsu graphs
2000
195-D Analyzing Polyline
geometry math sortings
1900
195-C Try and Catch
expression parsing implementation
1800
195-B After Training
data structures implementation math
1300
195-A Let's Watch Football
binary search brute force math
1000
194-B Square
math
1200
194-A Exams
implementation math
900
193-E Fibonacci Number
brute force math matrices
2900
193-D Two Segments
data structures
2900
193-C Hamming Distance
constructive algorithms greedy math +1
2400
193-B Xor
brute force
2000
193-A Cutting Figure
constructive algorithms graphs trees
1700
192-B Walking in the Rain
brute force implementation
1100
192-A Funky Numbers
binary search brute force implementation
1300
191-E Thwarting Demonstrations
binary search data structures trees
2200
191-D Metro Scheme
graphs greedy
2700
191-C Fools and Roads
data structures dfs and similar trees
1900
191-B Demonstration
greedy
1700
191-A Dynasty Puzzles
dp
1500
190-E Counter Attack
data structures dsu graphs +2
2100
190-D Non-Secret Cypher
two pointers
1900