| 1282-B2 |
K for the Price of One (Hard Version)
|
dp
greedy
sortings
|
1600
|
| 1282-B1 |
K for the Price of One (Easy Version)
|
dp
greedy
sortings
|
1400
|
| 1282-A |
Temporarily unavailable
|
implementation
math
|
900
|
| 1281-B |
Azamon Web Services
|
greedy
|
1600
|
| 1281-A |
Suffix Three
|
implementation
|
800
|
| 1280-F |
Intergalactic Sliding Puzzle
|
combinatorics
constructive algorithms
math
|
3400
|
| 1280-E |
Kirchhoff's Current Loss
|
math
|
2900
|
| 1280-D |
Miss Punyverse
|
dp
greedy
trees
|
2500
|
| 1280-C |
Jeremy Bearimy
|
dfs and similar
graphs
greedy
+1
|
2000
|
| 1280-B |
Beingawesomeism
|
implementation
math
|
1800
|
| 1280-A |
Cut and Paste
|
implementation
math
|
1700
|
| 1279-F |
New Year and Handle Change
|
binary search
dp
|
2800
|
| 1279-E |
New Year Permutations
|
combinatorics
dp
|
2700
|
| 1279-D |
Santa's Bot
|
combinatorics
math
probabilities
|
1700
|
| 1279-C |
Stack of Presents
|
data structures
implementation
|
1400
|
| 1279-B |
Verse For Santa
|
binary search
brute force
implementation
|
1300
|
| 1279-A |
New Year Garland
|
math
|
900
|
| 1278-F |
Cards
|
combinatorics
dp
math
+2
|
2600
|
| 1278-E |
Tests for problem D
|
constructive algorithms
dfs and similar
divide and conquer
+1
|
2200
|
| 1278-D |
Segment Tree
|
data structures
dsu
graphs
+1
|
2100
|
| 1278-C |
Berry Jam
|
data structures
dp
greedy
+1
|
1700
|
| 1278-B |
A and B
|
greedy
math
|
1500
|
| 1278-A |
Shuffle Hashing
|
brute force
implementation
strings
|
1000
|
| 1277-D |
Let's Play the Words?
|
data structures
hashing
implementation
+1
|
1900
|
| 1277-B |
Make Them Odd
|
greedy
number theory
|
1200
|
| 1277-A |
Happy Birthday, Polycarp!
|
implementation
|
1000
|
| 1276-F |
Asterisk Substrings
|
string suffix structures
|
3400
|
| 1276-E |
Four Stones
|
constructive algorithms
|
3500
|
| 1276-D |
Tree Elimination
|
dp
trees
|
2900
|
| 1276-C |
Beautiful Rectangle
|
brute force
combinatorics
constructive algorithms
+3
|
2300
|
| 1276-B |
Two Fairs
|
combinatorics
dfs and similar
dsu
+1
|
1900
|
| 1276-A |
As Simple as One and Two
|
dp
greedy
|
1400
|
| 1275-F |
Шардирование постов
|
*special
binary search
interactive
|
—
|
| 1275-E3 |
Контрольная сумма
|
*special
|
—
|
| 1275-E2 |
Контрольная сумма
|
*special
|
—
|
| 1275-E1 |
Контрольная сумма
|
*special
|
—
|
| 1275-D |
Storage2
|
*special
|
—
|
| 1275-C |
#define Задача B ...
|
*special
|
—
|
| 1275-B |
Code Review
|
*special
|
—
|
| 1275-A |
Скрытый друг
|
*special
|
—
|
| 1272-F |
Two Bracket Sequences
|
dp
strings
two pointers
|
2200
|
| 1272-E |
Nearest Opposite Parity
|
dfs and similar
graphs
shortest paths
|
1900
|
| 1272-D |
Remove One Element
|
brute force
dp
|
1500
|
| 1272-C |
Yet Another Broken Keyboard
|
combinatorics
dp
implementation
|
1200
|
| 1272-B |
Snow Walking Robot
|
constructive algorithms
greedy
implementation
|
1200
|
| 1272-A |
Three Friends
|
brute force
greedy
math
+1
|
900
|
| 1271-F |
Divide The Students
|
brute force
|
2700
|
| 1271-E |
Common Number
|
binary search
combinatorics
dp
+1
|
2100
|
| 1271-D |
Portals
|
data structures
dp
greedy
+2
|
2100
|
| 1271-C |
Shawarma Tent
|
brute force
geometry
greedy
+1
|
1300
|