| 1245-D |
Shichikuji and Power Grid
|
dsu
graphs
greedy
+2
|
1900
|
| 1245-C |
Constanze's Machine
|
dp
|
1400
|
| 1245-B |
Restricted RPS
|
constructive algorithms
dp
greedy
|
1200
|
| 1245-A |
Good ol' Numbers Coloring
|
math
number theory
|
1000
|
| 1244-G |
Running in Pairs
|
constructive algorithms
greedy
math
|
2400
|
| 1244-F |
Chips
|
constructive algorithms
implementation
|
2300
|
| 1244-E |
Minimizing Difference
|
binary search
constructive algorithms
greedy
+3
|
2000
|
| 1244-D |
Paint the Tree
|
brute force
constructive algorithms
dp
+3
|
1800
|
| 1244-C |
The Football Season
|
brute force
math
number theory
|
2000
|
| 1244-B |
Rooms and Staircases
|
brute force
implementation
|
1000
|
| 1244-A |
Pens and Pencils
|
math
|
800
|
| 1243-B2 |
Character Swap (Hard Version)
|
strings
|
1600
|
| 1243-B1 |
Character Swap (Easy Version)
|
strings
|
1000
|
| 1243-A |
Maximum Square
|
implementation
|
800
|
| 1242-E |
Planar Perimeter
|
constructive algorithms
graphs
|
3200
|
| 1242-D |
Number Discovery
|
math
|
3400
|
| 1242-C |
Sum Balance
|
bitmasks
dfs and similar
dp
+1
|
2400
|
| 1242-B |
0-1 MST
|
dfs and similar
dsu
graphs
+1
|
1900
|
| 1242-A |
Tile Painting
|
constructive algorithms
math
number theory
|
1500
|
| 1240-F |
Football
|
graphs
|
3100
|
| 1239-F |
Swiper, no swiping!
|
graphs
implementation
|
3400
|
| 1239-E |
Turtle
|
dp
implementation
|
3100
|
| 1239-D |
Catowice City
|
2-sat
dfs and similar
graph matchings
+1
|
2400
|
| 1239-C |
Queue in the Train
|
data structures
greedy
implementation
|
2300
|
| 1239-B |
The World Is Just a Programming Task (Hard Version)
|
implementation
|
2500
|
| 1239-A |
Ivan the Fool and the Probability Theory
|
combinatorics
dp
math
|
1700
|
| 1238-G |
Adilbek and the Watering System
|
data structures
greedy
sortings
|
2700
|
| 1238-F |
The Maximum Subtree
|
dfs and similar
dp
graphs
+1
|
2200
|
| 1238-E |
Keyboard Purchase
|
bitmasks
dp
|
2200
|
| 1238-D |
AB-string
|
binary search
combinatorics
dp
+1
|
1900
|
| 1238-C |
Standard Free2play
|
dp
greedy
math
|
1600
|
| 1238-B |
Kill `Em All
|
greedy
sortings
|
1300
|
| 1238-A |
Prime Subtraction
|
math
number theory
|
900
|
| 1237-H |
Balanced Reversals
|
constructive algorithms
|
3300
|
| 1237-G |
Balanced Distribution
|
data structures
dp
greedy
|
3500
|
| 1237-F |
Balanced Domino Placements
|
combinatorics
dp
|
2600
|
| 1237-E |
Balanced Binary Search Trees
|
dp
math
|
2400
|
| 1237-D |
Balanced Playlist
|
binary search
data structures
implementation
|
2000
|
| 1237-C2 |
Balanced Removals (Harder)
|
binary search
constructive algorithms
divide and conquer
+3
|
1900
|
| 1237-C1 |
Balanced Removals (Easier)
|
constructive algorithms
geometry
greedy
|
1700
|
| 1237-B |
Balanced Tunnel
|
data structures
sortings
two pointers
|
1300
|
| 1237-A |
Balanced Rating Changes
|
implementation
math
|
1000
|
| 1236-F |
Alice and the Cactus
|
dfs and similar
graphs
math
+1
|
3000
|
| 1236-E |
Alice and the Unfair Game
|
binary search
data structures
dp
+1
|
2500
|
| 1236-D |
Alice and the Doll
|
brute force
data structures
greedy
+1
|
2300
|
| 1236-C |
Labs
|
constructive algorithms
greedy
implementation
|
1300
|
| 1236-B |
Alice and the List of Presents
|
combinatorics
math
|
1500
|
| 1236-A |
Stones
|
brute force
greedy
math
|
800
|
| 1234-F |
Yet Another Substring Reverse
|
bitmasks
dp
|
2200
|
| 1234-E |
Special Permutations
|
math
|
2000
|