| 1266-A |
Competitive Programmer
|
chinese remainder theorem
math
|
1000
|
| 1265-E |
Beautiful Mirrors
|
data structures
dp
math
+1
|
2100
|
| 1265-B |
Beautiful Numbers
|
data structures
implementation
math
+1
|
1300
|
| 1265-A |
Beautiful String
|
constructive algorithms
greedy
|
1000
|
| 1264-F |
Beautiful Fibonacci Problem
|
constructive algorithms
number theory
|
3500
|
| 1264-E |
Beautiful League
|
constructive algorithms
flows
graph matchings
|
2700
|
| 1264-D2 |
Beautiful Bracket Sequence (hard version)
|
combinatorics
probabilities
|
2900
|
| 1264-D1 |
Beautiful Bracket Sequence (easy version)
|
combinatorics
dp
probabilities
|
2600
|
| 1264-C |
Beautiful Mirrors with queries
|
data structures
probabilities
|
2400
|
| 1264-B |
Beautiful Sequence
|
brute force
constructive algorithms
greedy
|
1900
|
| 1264-A |
Beautiful Regional Contest
|
greedy
implementation
|
1500
|
| 1263-F |
Economic Difficulties
|
data structures
dfs and similar
dp
+3
|
2400
|
| 1263-E |
Editor
|
data structures
implementation
|
2100
|
| 1263-D |
Secret Passwords
|
dfs and similar
dsu
graphs
|
1500
|
| 1263-C |
Everyone is a Winner!
|
binary search
math
meet-in-the-middle
+1
|
1400
|
| 1263-B |
PIN Codes
|
greedy
implementation
|
1400
|
| 1263-A |
Sweet Problem
|
math
|
1100
|
| 1261-F |
Xor-Set
|
bitmasks
divide and conquer
math
|
3100
|
| 1260-F |
Colored Tree
|
data structures
trees
|
2700
|
| 1260-E |
Tournament
|
brute force
dp
greedy
|
2400
|
| 1260-D |
A Game with Traps
|
binary search
dp
greedy
+1
|
1900
|
| 1260-C |
Infinite Fence
|
greedy
math
number theory
|
1700
|
| 1260-B |
Obtain Two Zeroes
|
binary search
math
|
1300
|
| 1260-A |
Heating
|
math
|
1000
|
| 1257-G |
Divisor Set
|
divide and conquer
fft
greedy
+2
|
2600
|
| 1257-F |
Make Them Similar
|
bitmasks
brute force
hashing
+1
|
2400
|
| 1257-E |
The Contest
|
data structures
dp
greedy
|
2000
|
| 1257-D |
Yet Another Monster Killing Problem
|
binary search
data structures
dp
+3
|
1700
|
| 1257-C |
Dominated Subarray
|
greedy
implementation
sortings
+2
|
1200
|
| 1257-B |
Magic Stick
|
math
|
1000
|
| 1257-A |
Two Rival Students
|
greedy
math
|
800
|
| 1256-F |
Equalizing Two Strings
|
constructive algorithms
sortings
strings
|
2000
|
| 1256-E |
Yet Another Division Into Teams
|
dp
greedy
sortings
|
2000
|
| 1256-D |
Binary String Minimizing
|
greedy
|
1500
|
| 1256-C |
Platforms Jumping
|
greedy
|
1700
|
| 1256-B |
Minimize the Permutation
|
greedy
|
1400
|
| 1256-A |
Payment Without Change
|
math
|
1000
|
| 1255-C |
League of Leesins
|
constructive algorithms
implementation
|
1600
|
| 1255-B |
Fridge Lockers
|
graphs
implementation
|
1100
|
| 1255-A |
Changing Volume
|
math
|
800
|
| 1254-E |
Send Tree to Charlie
|
combinatorics
dfs and similar
dsu
+1
|
3300
|
| 1254-D |
Tree Queries
|
data structures
probabilities
trees
|
2700
|
| 1254-C |
Point Ordering
|
constructive algorithms
geometry
interactive
+1
|
2300
|
| 1254-B2 |
Send Boxes to Alice (Hard Version)
|
constructive algorithms
greedy
math
+3
|
2100
|
| 1254-B1 |
Send Boxes to Alice (Easy Version)
|
constructive algorithms
greedy
math
+3
|
1800
|
| 1254-A |
Feeding Chicken
|
constructive algorithms
greedy
implementation
|
1700
|
| 1253-F |
Cheap Robot
|
binary search
dsu
graphs
+2
|
2500
|
| 1253-E |
Antenna Coverage
|
data structures
dp
greedy
+1
|
2200
|
| 1253-D |
Harmonious Graph
|
constructive algorithms
dfs and similar
dsu
+3
|
1700
|
| 1253-C |
Sweets Eating
|
dp
greedy
math
+1
|
1500
|