Problems Playground
Login
Min rating
Max rating
Tag
Reset
# Problem Tags Rating Solved
1334-D Minimum Euler Cycle
constructive algorithms graphs greedy +1
1800
1334-C Circle of Monsters
brute force constructive algorithms greedy +1
1600
1334-B Middle Class
greedy sortings
1100
1334-A Level Statistics
implementation math
1200
1333-F Kate and imperfection
greedy implementation math +3
2200
1333-E Road to 1600
brute force constructive algorithms
2400
1333-D Challenges in school №41
brute force constructive algorithms games +4
2100
1333-C Eugene and an array
binary search data structures implementation +1
1700
1333-B Kind Anton
greedy implementation
1100
1333-A Little Artem
constructive algorithms
1000
1332-G No Monotone Triples
data structures
3100
1332-F Independent Set
dfs and similar dp trees
2500
1332-E Height All the Same
combinatorics constructive algorithms math +1
2100
1332-D Walk on Matrix
bitmasks constructive algorithms math
1700
1332-C K-Complete Word
dfs and similar dsu greedy +2
1500
1332-B Composite Coloring
brute force constructive algorithms greedy +2
1400
1332-A Exercising Walk
greedy implementation math
1100
1331-H It's showtime
*special
1331-G Lingua Romana
*special
1331-F Elementary!
*special brute force dp +1
1331-E Jordan Smiley
*special dfs and similar geometry +1
1331-D Again?
*special implementation
1331-C ...And after happily lived ever they
*special bitmasks
1331-B Limericks
*special math number theory
1331-A Is it rated?
*special
1330-B Dreamoon Likes Permutations
implementation math
1400
1330-A Dreamoon and Ranking Collection
implementation
900
1329-E Dreamoon Loves AA
binary search greedy
3300
1329-D Dreamoon Likes Strings
constructive algorithms data structures
3100
1329-C Drazil Likes Heap
constructive algorithms data structures greedy +1
2400
1329-B Dreamoon Likes Sequences
bitmasks combinatorics math
1700
1329-A Dreamoon Likes Coloring
constructive algorithms greedy implementation +1
1800
1328-F Make k Equal
greedy
2200
1328-E Tree Queries
dfs and similar graphs trees
1900
1328-D Carousel
constructive algorithms dp graphs +2
1800
1328-C Ternary XOR
greedy implementation
1200
1328-B K-th Beautiful String
binary search brute force combinatorics +2
1300
1328-A Divisibility Problem
math
800
1327-G Letters and Question Marks
bitmasks dp string suffix structures
2800
1327-F AND Segments
bitmasks combinatorics data structures +2
2500
1327-E Count The Blocks
combinatorics dp math
1800
1327-D Infinite Path
brute force dfs and similar graphs +2
2200
1327-C Game with Chips
constructive algorithms implementation
1600
1327-B Princesses and Princes
brute force graphs greedy
1200
1327-A Sum of Odd Integers
math
1100
1326-G Spiderweb Trees
dp geometry trees
3500
1326-F2 Wise Men (Hard Version)
bitmasks dp math
3200
1326-F1 Wise Men (Easy Version)
bitmasks brute force dp +1
2600
1326-E Bombs
data structures two pointers
2400
1326-D2 Prefix-Suffix Palindrome (Hard version)
binary search greedy hashing +2
1800