Problems Playground
Login
Min rating
Max rating
Tag
Reset
# Problem Tags Rating Solved
1919-E Counting Prefixes
combinatorics constructive algorithms dp +2
2600
1919-D 01 Tree
constructive algorithms data structures dsu +3
2100
1919-C Grouping Increases
data structures dp greedy
1400
1919-B Plus-Minus Split
greedy
800
1919-A Wallet Exchange
games math
800
1918-G Permutation of Given
constructive algorithms math
2700
1918-F Caterpillar on a Tree
dfs and similar graphs greedy +3
2500
1918-E ace5 and Task Order
constructive algorithms divide and conquer implementation +3
2200
1918-D Blocking Elements
binary search data structures dp +2
1900
1918-C XOR-distance
bitmasks greedy implementation +1
1400
1918-B Minimize Inversions
constructive algorithms data structures greedy +2
900
1918-A Brick Wall
constructive algorithms greedy implementation +1
800
1917-F Construct Tree
bitmasks constructive algorithms dp +1
2500
1917-E Construct Matrix
constructive algorithms math
2500
1917-D Yet Another Inversions Problem
combinatorics data structures dp +3
2300
1917-C Watering an Array
brute force greedy implementation +1
1600
1917-B Erase First or Second Letter
brute force combinatorics data structures +2
1100
1917-A Least Product
constructive algorithms math
800
1916-H2 Matrix Rank (Hard Version)
combinatorics dp math +2
2700
1916-H1 Matrix Rank (Easy Version)
brute force combinatorics dp +2
2700
1916-G Optimizations From Chelsu
divide and conquer dp number theory +1
3500
1916-F Group Division
constructive algorithms dfs and similar graphs +1
2900
1916-E Happy Life in University
data structures dfs and similar greedy +1
2300
1916-D Mathematical Problem
brute force constructive algorithms geometry +1
1700
1916-C Training Before the Olympiad
constructive algorithms games greedy +2
1200
1916-B Two Divisors
constructive algorithms math number theory
1000
1916-A 2023
constructive algorithms implementation math +1
800
1915-G Bicycles
graphs greedy implementation +2
1800
1915-F Greetings
data structures divide and conquer sortings
1500
1915-E Romantic Glasses
data structures greedy math
1300
1915-D Unnatural Language Processing
greedy implementation strings
900
1915-C Can I Square?
binary search implementation
800
1915-B Not Quite Latin Square
bitmasks brute force implementation
800
1915-A Odd One Out
bitmasks implementation
800
1914-G2 Light Bulbs (Hard Version)
combinatorics data structures dfs and similar +3
2300
1914-G1 Light Bulbs (Easy Version)
brute force combinatorics dfs and similar +5
2100
1914-F Programming Competition
dfs and similar dp graph matchings +2
1900
1914-E2 Game with Marbles (Hard Version)
games greedy sortings
1400
1914-E1 Game with Marbles (Easy Version)
brute force games greedy +1
1400
1914-D Three Activities
brute force dp greedy +2
1200
1914-C Quests
greedy math
1100
1914-B Preparing for the Contest
constructive algorithms math
800
1914-A Problemsolving Log
implementation strings
800
1913-F Palindromic Problem
binary search data structures hashing +2
2800
1913-E Matrix Problem
flows graphs
2400
1913-D Array Collapse
data structures divide and conquer dp +1
2100
1913-C Game with Multiset
binary search bitmasks brute force +1
1300
1913-B Swap and Delete
strings
1000
1913-A Rating Increase
implementation
800
1912-L LOL Lovers
strings
800