| 2049-B |
pspspsps
|
brute force
constructive algorithms
graph matchings
+1
|
1300
|
| 2049-A |
MEX Destruction
|
greedy
implementation
|
800
|
| 2048-I2 |
Kevin and Puzzle (Hard Version)
|
bitmasks
fft
math
|
3500
|
| 2048-I1 |
Kevin and Puzzle (Easy Version)
|
constructive algorithms
|
3500
|
| 2048-H |
Kevin and Strange Operation
|
data structures
dp
|
3100
|
| 2048-G |
Kevin and Matrices
|
brute force
combinatorics
dp
+1
|
2800
|
| 2048-F |
Kevin and Math Class
|
brute force
data structures
divide and conquer
+4
|
2500
|
| 2048-E |
Kevin and Bipartite Graph
|
constructive algorithms
graphs
greedy
|
2000
|
| 2048-D |
Kevin and Competition Memories
|
binary search
brute force
data structures
+3
|
1600
|
| 2048-C |
Kevin and Binary Strings
|
bitmasks
brute force
greedy
+2
|
1200
|
| 2048-B |
Kevin and Permutation
|
constructive algorithms
greedy
|
900
|
| 2048-A |
Kevin and Combination Lock
|
brute force
greedy
implementation
+2
|
800
|
| 2047-B |
Replace Character
|
brute force
combinatorics
greedy
+1
|
900
|
| 2047-A |
Alyona and a Square Jigsaw Puzzle
|
implementation
math
|
800
|
| 2046-F2 |
Yandex Cuneiform (Hard Version)
|
constructive algorithms
data structures
greedy
+1
|
3500
|
| 2046-F1 |
Yandex Cuneiform (Easy Version)
|
constructive algorithms
data structures
greedy
|
3300
|
| 2046-E2 |
Cheops and a Contest (Hard Version)
|
greedy
implementation
|
3500
|
| 2046-E1 |
Cheops and a Contest (Easy Version)
|
constructive algorithms
greedy
|
2900
|
| 2046-D |
For the Emperor!
|
flows
graphs
|
3100
|
| 2046-C |
Adventurers
|
binary search
data structures
greedy
+3
|
2100
|
| 2046-B |
Move Back at a Cost
|
binary search
data structures
greedy
+1
|
1600
|
| 2046-A |
Swap Columns and Find a Path
|
greedy
sortings
|
1200
|
| 2045-M |
Mirror Maze
|
brute force
dfs and similar
graphs
+1
|
1800
|
| 2045-L |
Buggy DFS
|
constructive algorithms
|
3000
|
| 2045-K |
GCDDCG
|
|
2900
|
| 2045-J |
Xorderable Array
|
bitmasks
data structures
|
2600
|
| 2045-I |
Microwavable Subsequence
|
data structures
|
2100
|
| 2045-H |
Missing Separators
|
dp
sortings
string suffix structures
+1
|
2200
|
| 2045-G |
X Aura
|
graphs
math
shortest paths
|
2200
|
| 2045-F |
Grid Game 3-angle
|
games
math
|
3000
|
| 2045-E |
Narrower Passageway
|
combinatorics
data structures
|
2700
|
| 2045-D |
Aquatic Dragon
|
|
3500
|
| 2045-C |
Saraga
|
greedy
strings
|
1400
|
| 2045-B |
ICPC Square
|
math
number theory
|
2000
|
| 2045-A |
Scrambled Scrabble
|
brute force
greedy
|
1700
|
| 2044-H |
Hard Demon Problem
|
constructive algorithms
data structures
dp
+2
|
2100
|
| 2044-G2 |
Medium Demon Problem (hard version)
|
dfs and similar
dp
dsu
+3
|
1900
|
| 2044-G1 |
Medium Demon Problem (easy version)
|
dfs and similar
graph matchings
graphs
+2
|
1700
|
| 2044-F |
Easy Demon Problem
|
binary search
brute force
data structures
+2
|
1900
|
| 2044-E |
Insane Problem
|
binary search
greedy
implementation
+2
|
1300
|
| 2044-D |
Harder Problem
|
constructive algorithms
greedy
math
|
1100
|
| 2044-C |
Hard Problem
|
greedy
math
|
800
|
| 2044-B |
Normal Problem
|
implementation
strings
|
800
|
| 2044-A |
Easy Problem
|
brute force
math
|
800
|
| 2043-G |
Problem with Queries
|
brute force
data structures
implementation
|
3000
|
| 2043-F |
Nim
|
bitmasks
brute force
combinatorics
+5
|
2700
|
| 2043-E |
Matrix Transformation
|
bitmasks
brute force
data structures
+4
|
2300
|
| 2043-D |
Problem about GCD
|
brute force
flows
math
+1
|
1800
|
| 2043-C |
Sums on Segments
|
binary search
brute force
data structures
+3
|
1600
|
| 2043-B |
Digits
|
math
number theory
|
1100
|