Problems Playground
Login
Min rating
Max rating
Tag
Reset
# Problem Tags Rating Solved
1718-E Impressionism
constructive algorithms graphs implementation +1
3500
1718-D Permutation for Burenka
data structures graph matchings greedy +2
3300
1718-C Tonya and Burenka-179
data structures greedy math +1
2400
1718-B Fibonacci Strings
greedy implementation math +1
2000
1718-A2 Burenka and Traditions (hard version)
data structures dp greedy
1900
1718-A1 Burenka and Traditions (easy version)
dp greedy
1800
1717-F Madoka and The First Session
constructive algorithms flows graph matchings +2
2500
1717-E Madoka and The Best University
math number theory
2200
1717-D Madoka and The Corruption Scheme
combinatorics constructive algorithms greedy +1
1900
1717-C Madoka and Formal Statement
greedy
1300
1717-B Madoka and Underground Competitions
constructive algorithms implementation
1100
1717-A Madoka and Strange Thoughts
math number theory
800
1716-F Bags with Balls
combinatorics dp math +1
2500
1716-E Swap and Maximum Block
bitmasks data structures dfs and similar +2
2500
1716-D Chip Move
brute force dp math
2000
1716-C Robot in a Hallway
data structures dp greedy +2
2000
1716-B Permutation Chain
constructive algorithms math
800
1716-A 2-3 Moves
greedy math
800
1715-F Crop Squares
constructive algorithms geometry interactive +1
2700
1715-E Long Way Home
data structures divide and conquer dp +4
2400
1715-D 2+ doors
2-sat bitmasks graphs +1
1900
1715-C Monoblock
combinatorics data structures implementation +1
1700
1715-B Beautiful Array
constructive algorithms greedy math
1000
1715-A Crossmarket
constructive algorithms greedy math
800
1714-G Path Prefixes
binary search data structures dfs and similar +1
1700
1714-F Build a Tree and That Is It
constructive algorithms implementation trees
1900
1714-E Add Modulo 10
brute force math number theory
1400
1714-D Color with Occurrences
brute force data structures dp +2
1600
1714-C Minimum Varied Number
greedy
800
1714-B Remove Prefix
data structures greedy implementation
800
1714-A Everyone Loves to Sleep
implementation math
900
1713-F Lost Array
bitmasks combinatorics constructive algorithms +2
2900
1713-E Cross Swapping
2-sat data structures dsu +2
2400
1713-D Tournament Countdown
constructive algorithms greedy interactive +2
1800
1713-C Build Permutation
constructive algorithms dp math
1200
1713-B Optimal Reduction
constructive algorithms sortings
1000
1713-A Traveling Salesman Problem
geometry greedy implementation
800
1712-F Triameter
binary search data structures dfs and similar +1
3200
1712-E2 LCM Sum (hard version)
brute force data structures math +2
2500
1712-E1 LCM Sum (easy version)
binary search brute force combinatorics +3
2300
1712-D Empty Graph
binary search constructive algorithms data structures +2
2000
1712-C Sort Zero
greedy sortings
1100
1712-B Woeful Permutation
constructive algorithms greedy number theory
800
1712-A Wonderful Permutation
greedy implementation
800
1711-B Party
brute force graphs
1300
1711-A Perfect Permutation
constructive algorithms
800
1710-E Two Arrays
binary search games graph matchings
2400
1710-D Recover the Tree
constructive algorithms trees
3400
1710-C XOR Triangle
bitmasks brute force constructive algorithms +3
2500
1710-B Rain
binary search brute force data structures +4
2100