| 975-B |
Mancala
|
brute force
implementation
|
1100
|
| 975-A |
Aramic script
|
implementation
strings
|
900
|
| 967-B |
Watering System
|
math
sortings
|
1000
|
| 967-A |
Mind the Gap
|
implementation
|
1100
|
| 965-E |
Short Code
|
data structures
dp
greedy
+2
|
2200
|
| 965-D |
Single-use Stones
|
binary search
flows
greedy
+1
|
1900
|
| 965-C |
Greedy Arkady
|
math
|
2000
|
| 965-B |
Battleship
|
implementation
|
1300
|
| 965-A |
Paper Airplanes
|
math
|
800
|
| 964-B |
Messages
|
math
|
1300
|
| 964-A |
Splits
|
math
|
800
|
| 963-E |
Circles of Waiting
|
math
|
3100
|
| 963-D |
Frequency of String
|
hashing
string suffix structures
strings
|
2500
|
| 963-C |
Cutting Rectangle
|
brute force
math
number theory
|
2600
|
| 963-B |
Destruction of a Tree
|
constructive algorithms
dfs and similar
dp
+2
|
2000
|
| 963-A |
Alternating Sum
|
math
number theory
|
1800
|
| 962-G |
Visible Black Areas
|
data structures
dsu
geometry
+1
|
2800
|
| 962-F |
Simple Cycles Edges
|
dfs and similar
graphs
trees
|
2400
|
| 962-E |
Byteland, Berland and Disputed Cities
|
constructive algorithms
greedy
|
2200
|
| 962-D |
Merge Equals
|
data structures
implementation
|
1600
|
| 962-C |
Make a Square
|
brute force
implementation
math
|
1400
|
| 962-B |
Students in Railway Carriage
|
constructive algorithms
greedy
implementation
|
1300
|
| 962-A |
Equator
|
implementation
|
1300
|
| 961-G |
Partitions
|
combinatorics
math
number theory
|
2700
|
| 961-F |
k-substrings
|
binary search
hashing
string suffix structures
|
2700
|
| 961-E |
Tufurama
|
data structures
|
1900
|
| 961-D |
Pair Of Lines
|
geometry
|
2000
|
| 961-C |
Chessboard
|
bitmasks
brute force
implementation
|
1400
|
| 961-B |
Lecture Sleep
|
data structures
dp
implementation
+1
|
1200
|
| 961-A |
Tetris
|
implementation
|
900
|
| 960-H |
Santa's Gift
|
data structures
trees
|
3100
|
| 960-G |
Bandit Blues
|
combinatorics
dp
fft
+1
|
2900
|
| 960-F |
Pathwalks
|
data structures
dp
graphs
|
2100
|
| 960-E |
Alternating Tree
|
combinatorics
dfs and similar
divide and conquer
+3
|
2300
|
| 960-D |
Full Binary Tree Queries
|
brute force
implementation
trees
|
2100
|
| 960-C |
Subsequence Counting
|
bitmasks
constructive algorithms
greedy
+1
|
1700
|
| 960-B |
Minimize the error
|
data structures
greedy
sortings
|
1500
|
| 960-A |
Check the string
|
implementation
|
1200
|
| 959-F |
Mahmoud and Ehab and yet another xor task
|
bitmasks
dp
math
+1
|
2400
|
| 959-E |
Mahmoud and Ehab and the xor-MST
|
bitmasks
dp
graphs
+2
|
1900
|
| 959-D |
Mahmoud and Ehab and another array construction task
|
constructive algorithms
greedy
math
+1
|
1900
|
| 959-C |
Mahmoud and Ehab and the wrong algorithm
|
constructive algorithms
trees
|
1500
|
| 959-B |
Mahmoud and Ehab and the message
|
dsu
greedy
implementation
|
1200
|
| 959-A |
Mahmoud and Ehab and the even-odd game
|
games
math
|
800
|
| 958-F3 |
Lightsabers (hard)
|
fft
|
2600
|
| 958-F2 |
Lightsabers (medium)
|
binary search
two pointers
|
1800
|
| 958-F1 |
Lightsabers (easy)
|
implementation
|
1500
|
| 958-E3 |
Guard Duty (hard)
|
geometry
|
2700
|
| 958-E2 |
Guard Duty (medium)
|
binary search
dp
greedy
+1
|
2200
|
| 958-E1 |
Guard Duty (easy)
|
brute force
geometry
greedy
+1
|
1600
|