| 1970-D1 |
Arithmancy (Easy)
|
brute force
constructive algorithms
interactive
+1
|
2100
|
| 1970-C3 |
Game on Tree (Hard)
|
dfs and similar
dp
games
+1
|
1900
|
| 1970-C2 |
Game on Tree (Medium)
|
dfs and similar
dp
games
+1
|
1700
|
| 1970-C1 |
Game on Tree (Easy)
|
games
|
1400
|
| 1970-B3 |
Exact Neighbours (Hard)
|
constructive algorithms
|
2300
|
| 1970-B2 |
Exact Neighbours (Medium)
|
constructive algorithms
|
2100
|
| 1970-B1 |
Exact Neighbours (Easy)
|
constructive algorithms
|
1900
|
| 1970-A3 |
Balanced Unshuffle (Hard)
|
constructive algorithms
trees
|
2400
|
| 1970-A2 |
Balanced Unshuffle (Medium)
|
brute force
constructive algorithms
trees
|
2400
|
| 1970-A1 |
Balanced Shuffle (Easy)
|
implementation
sortings
|
1000
|
| 1969-F |
Card Pairing
|
dp
greedy
hashing
+1
|
3000
|
| 1969-E |
Unique Array
|
binary search
data structures
divide and conquer
+2
|
2400
|
| 1969-D |
Shop Game
|
data structures
greedy
math
+1
|
1900
|
| 1969-C |
Minimizing the Sum
|
dp
implementation
|
1700
|
| 1969-B |
Shifts and Sorting
|
constructive algorithms
greedy
|
1000
|
| 1969-A |
Two Friends
|
constructive algorithms
implementation
math
|
800
|
| 1968-G2 |
Division + LCP (hard version)
|
binary search
brute force
data structures
+5
|
2200
|
| 1968-G1 |
Division + LCP (easy version)
|
binary search
data structures
dp
+3
|
1900
|
| 1968-F |
Equal XOR Segments
|
binary search
data structures
|
1800
|
| 1968-E |
Cells Arrangement
|
constructive algorithms
|
1600
|
| 1968-D |
Permutation Game
|
brute force
dfs and similar
games
+3
|
1300
|
| 1968-C |
Assembly via Remainders
|
constructive algorithms
number theory
|
1000
|
| 1968-B |
Prefiquence
|
greedy
two pointers
|
800
|
| 1968-A |
Maximize?
|
brute force
math
number theory
|
800
|
| 1967-F |
Next and Prev
|
brute force
data structures
implementation
|
3200
|
| 1967-E2 |
Again Counting Arrays (Hard Version)
|
combinatorics
dp
math
|
3500
|
| 1967-E1 |
Again Counting Arrays (Easy Version)
|
combinatorics
dp
fft
+1
|
3100
|
| 1967-D |
Long Way to be Non-decreasing
|
binary search
dfs and similar
graphs
+3
|
2800
|
| 1967-C |
Fenwick Tree
|
bitmasks
brute force
combinatorics
+4
|
2300
|
| 1967-B2 |
Reverse Card (Hard Version)
|
brute force
math
number theory
|
2200
|
| 1967-B1 |
Reverse Card (Easy Version)
|
brute force
math
number theory
|
1400
|
| 1967-A |
Permutation Counting
|
binary search
greedy
implementation
+2
|
1400
|
| 1966-B |
Rectangle Filling
|
constructive algorithms
implementation
|
1100
|
| 1966-A |
Card Exchange
|
constructive algorithms
games
greedy
|
800
|
| 1965-F |
Conference
|
data structures
flows
|
3300
|
| 1965-E |
Connected Cubes
|
constructive algorithms
games
|
3100
|
| 1965-D |
Missing Subarray Sum
|
constructive algorithms
|
2900
|
| 1965-C |
Folding Strip
|
constructive algorithms
greedy
strings
|
2300
|
| 1965-B |
Missing Subsequence Sum
|
bitmasks
constructive algorithms
greedy
+1
|
1800
|
| 1965-A |
Everything Nim
|
games
greedy
math
+1
|
1400
|
| 1958-J |
Necromancer
|
*special
|
3200
|
| 1958-I |
Equal Trees
|
*special
graphs
meet-in-the-middle
|
3100
|
| 1958-H |
Composite Spells
|
*special
dp
|
2600
|
| 1958-G |
Observation Towers
|
*special
|
2400
|
| 1958-F |
Narrow Paths
|
*special
combinatorics
|
2000
|
| 1958-E |
Yet Another Permutation Constructive
|
*special
constructive algorithms
|
1900
|
| 1958-D |
Staircase
|
*special
|
1600
|
| 1958-C |
Firewood
|
*special
|
1500
|
| 1958-B |
Clock in the Pool
|
*special
math
|
1400
|
| 1958-A |
1-3-5
|
*special
dp
|
1100
|