| 2174-B |
Wishing Cards
|
dp
|
1900
|
| 2174-A |
Needle in a Haystack
|
greedy
strings
two pointers
|
1200
|
| 2173-F |
Isla's Memory Thresholds
|
binary search
brute force
data structures
+2
|
2600
|
| 2173-E |
Shiro's Mirror Duel
|
constructive algorithms
greedy
interactive
+2
|
2200
|
| 2173-D |
Taiga's Carry Chains
|
bitmasks
brute force
dp
+2
|
1900
|
| 2173-C |
Kanade's Perfect Multiples
|
brute force
constructive algorithms
greedy
+1
|
1400
|
| 2173-B |
Niko's Tactical Cards
|
dp
greedy
math
|
1100
|
| 2173-A |
Sleeping Through Classes
|
greedy
implementation
|
800
|
| 2172-N |
New Kingdom
|
constructive algorithms
graphs
implementation
|
2800
|
| 2172-M |
Maximum Distance To Port
|
graphs
shortest paths
|
1300
|
| 2172-L |
Maximum Color Segment
|
dp
implementation
|
2300
|
| 2172-K |
Kindergarten Homework
|
implementation
strings
|
2100
|
| 2172-J |
Sliding Tiles
|
data structures
divide and conquer
dsu
|
2300
|
| 2172-I |
Birthday
|
geometry
|
2000
|
| 2172-H |
Shuffling Cards with Problem Solver 68!
|
hashing
string suffix structures
strings
|
2500
|
| 2172-G |
Gene Editor
|
|
3300
|
| 2172-F |
Cluster Computing System
|
graphs
greedy
math
|
1600
|
| 2172-E |
Number Maze
|
implementation
|
1200
|
| 2172-D |
Divisor Card Game
|
combinatorics
dp
|
3100
|
| 2172-C |
Circles Are Far from Each Other
|
binary search
greedy
|
3100
|
| 2172-B |
Buses
|
greedy
sortings
|
1800
|
| 2172-A |
ASCII Art Contest
|
implementation
|
800
|
| 2171-H |
Shiori Miyagi and Maximum Array Score
|
binary search
data structures
dp
+1
|
2400
|
| 2171-G |
Sakura Adachi and Optimal Sequences
|
bitmasks
combinatorics
greedy
+1
|
2000
|
| 2171-F |
Rae Taylor and Trees (hard version)
|
binary search
constructive algorithms
data structures
+5
|
1600
|
| 2171-E |
Anisphia Wynn Palettia and Good Permutations
|
constructive algorithms
greedy
number theory
|
2000
|
| 2171-D |
Rae Taylor and Trees (easy version)
|
binary search
data structures
dp
+4
|
1400
|
| 2171-C2 |
Renako Amaori and XOR Game (hard version)
|
bitmasks
games
greedy
|
1400
|
| 2171-C1 |
Renako Amaori and XOR Game (easy version)
|
bitmasks
games
greedy
|
1100
|
| 2171-B |
Yuu Koito and Minimum Absolute Sum
|
math
|
900
|
| 2171-A |
Shizuku Hoshikawa and Farm Legs
|
brute force
math
|
800
|
| 2170-F |
Build XOR on a Segment
|
bitmasks
dp
|
2600
|
| 2170-E |
Binary Strings and Blocks
|
combinatorics
data structures
dp
|
2100
|
| 2170-D |
Almost Roman
|
constructive algorithms
greedy
implementation
|
2200
|
| 2170-C |
Quotient and Remainder
|
binary search
greedy
two pointers
|
1300
|
| 2170-B |
Addition on a Segment
|
greedy
math
|
1200
|
| 2170-A |
Maximum Neighborhood
|
bitmasks
brute force
greedy
+2
|
800
|
| 2169-F |
Subsequence Problem
|
combinatorics
dp
fft
+1
|
2700
|
| 2169-E |
Points Selection
|
dp
greedy
|
2400
|
| 2169-D2 |
Removal of a Sequence (Hard Version)
|
binary search
divide and conquer
greedy
+3
|
2100
|
| 2169-D1 |
Removal of a Sequence (Easy Version)
|
binary search
implementation
math
+1
|
1500
|
| 2169-C |
Range Operation
|
dp
greedy
math
+1
|
1300
|
| 2169-B |
Drifting Away
|
greedy
implementation
|
1100
|
| 2169-A |
Alice and Bob
|
greedy
implementation
|
900
|
| 2168-C |
Intercepting Butterflies
|
bitmasks
communication
constructive algorithms
+2
|
—
|
| 2168-B |
Locate
|
binary search
combinatorics
communication
+3
|
—
|
| 2168-A2 |
Encode and Decode (Hard Version)
|
bitmasks
communication
interactive
+1
|
—
|
| 2168-A1 |
Encode and Decode (Easy Version)
|
communication
constructive algorithms
interactive
|
—
|
| 2167-G |
Mukhammadali and the Smooth Array
|
data structures
dp
|
1600
|
| 2167-F |
Tree, TREE!!!
|
dfs and similar
dp
math
+1
|
1600
|