| 1344-E |
Train Tracks
|
data structures
trees
|
3100
|
| 1344-D |
Résumé Review
|
binary search
greedy
math
|
2700
|
| 1344-C |
Quantifier Question
|
dfs and similar
dp
graphs
+1
|
2600
|
| 1344-B |
Monopole Magnets
|
constructive algorithms
dfs and similar
dsu
+1
|
2000
|
| 1344-A |
Hilbert's Hotel
|
math
number theory
sortings
|
1600
|
| 1343-F |
Restore the Permutation by Sorted Segments
|
brute force
constructive algorithms
data structures
+2
|
2400
|
| 1343-E |
Weights Distributing
|
brute force
graphs
greedy
+2
|
2100
|
| 1343-D |
Constant Palindrome Sum
|
brute force
data structures
greedy
+1
|
1700
|
| 1343-C |
Alternating Subsequence
|
dp
greedy
two pointers
|
1200
|
| 1343-B |
Balanced Array
|
constructive algorithms
math
|
800
|
| 1343-A |
Candies
|
brute force
math
|
900
|
| 1342-F |
Make It Ascending
|
bitmasks
brute force
dp
|
3000
|
| 1342-E |
Placing Rooks
|
combinatorics
fft
math
|
2300
|
| 1342-D |
Multiple Testcases
|
binary search
constructive algorithms
data structures
+3
|
1900
|
| 1342-C |
Yet Another Counting Problem
|
math
number theory
|
1600
|
| 1342-B |
Binary Period
|
constructive algorithms
strings
|
1100
|
| 1342-A |
Road To Zero
|
greedy
math
|
1000
|
| 1341-B |
Nastya and Door
|
greedy
implementation
|
1300
|
| 1341-A |
Nastya and Rice
|
math
|
900
|
| 1340-F |
Nastya and CBS
|
brute force
data structures
hashing
|
3300
|
| 1340-D |
Nastya and Time Machine
|
constructive algorithms
dfs and similar
graphs
+1
|
2600
|
| 1340-C |
Nastya and Unexpected Guest
|
dfs and similar
dp
graphs
+1
|
2400
|
| 1340-B |
Nastya and Scoreboard
|
bitmasks
dp
graphs
+1
|
1700
|
| 1340-A |
Nastya and Strange Generator
|
brute force
data structures
greedy
+1
|
1500
|
| 1339-B |
Sorted Adjacent Differences
|
constructive algorithms
sortings
|
1200
|
| 1339-A |
Filling Diamonds
|
brute force
dp
implementation
+1
|
900
|
| 1338-E |
JYPnation
|
graphs
|
3500
|
| 1338-D |
Nested Rubber Bands
|
constructive algorithms
dfs and similar
dp
+2
|
2700
|
| 1338-C |
Perfect Triples
|
bitmasks
brute force
constructive algorithms
+2
|
2200
|
| 1338-B |
Edge Weight Assignment
|
bitmasks
constructive algorithms
dfs and similar
+3
|
1800
|
| 1338-A |
Powered Addition
|
greedy
math
|
1500
|
| 1337-B |
Kana and Dragon Quest game
|
greedy
implementation
math
|
900
|
| 1337-A |
Ichihime and Triangle
|
constructive algorithms
math
|
800
|
| 1336-F |
Journey
|
data structures
divide and conquer
graphs
+1
|
3500
|
| 1336-E2 |
Chiori and Doll Picking (hard version)
|
bitmasks
brute force
combinatorics
+1
|
3500
|
| 1336-E1 |
Chiori and Doll Picking (easy version)
|
bitmasks
brute force
combinatorics
+1
|
2700
|
| 1336-D |
Yui and Mahjong Set
|
constructive algorithms
interactive
|
3200
|
| 1336-C |
Kaavi and Magic Spell
|
dp
strings
|
2200
|
| 1336-B |
Xenia and Colorful Gems
|
binary search
greedy
math
+2
|
1700
|
| 1336-A |
Linova and Kingdom
|
dfs and similar
dp
greedy
+2
|
1600
|
| 1335-F |
Robots on a Grid
|
data structures
dfs and similar
dsu
+3
|
2200
|
| 1335-E2 |
Three Blocks Palindrome (hard version)
|
brute force
data structures
dp
+1
|
1800
|
| 1335-E1 |
Three Blocks Palindrome (easy version)
|
binary search
brute force
data structures
+2
|
1700
|
| 1335-D |
Anti-Sudoku
|
constructive algorithms
implementation
|
1300
|
| 1335-C |
Two Teams Composing
|
binary search
greedy
implementation
+1
|
1100
|
| 1335-B |
Construct the String
|
constructive algorithms
|
900
|
| 1335-A |
Candies and Two Sisters
|
math
|
800
|
| 1334-G |
Substring Search
|
bitmasks
brute force
fft
|
2900
|
| 1334-F |
Strange Function
|
binary search
data structures
dp
+1
|
2500
|
| 1334-E |
Divisor Paths
|
combinatorics
graphs
greedy
+2
|
2200
|