| 1328-A |
Divisibility Problem
|
math
|
800
|
| 1327-G |
Letters and Question Marks
|
bitmasks
dp
string suffix structures
|
2800
|
| 1327-F |
AND Segments
|
bitmasks
combinatorics
data structures
+2
|
2500
|
| 1327-E |
Count The Blocks
|
combinatorics
dp
math
|
1800
|
| 1327-D |
Infinite Path
|
brute force
dfs and similar
graphs
+2
|
2200
|
| 1327-C |
Game with Chips
|
constructive algorithms
implementation
|
1600
|
| 1327-B |
Princesses and Princes
|
brute force
graphs
greedy
|
1200
|
| 1327-A |
Sum of Odd Integers
|
math
|
1100
|
| 1326-G |
Spiderweb Trees
|
dp
geometry
trees
|
3500
|
| 1326-F2 |
Wise Men (Hard Version)
|
bitmasks
dp
math
|
3200
|
| 1326-F1 |
Wise Men (Easy Version)
|
bitmasks
brute force
dp
+1
|
2600
|
| 1326-E |
Bombs
|
data structures
two pointers
|
2400
|
| 1326-D2 |
Prefix-Suffix Palindrome (Hard version)
|
binary search
greedy
hashing
+2
|
1800
|
| 1326-D1 |
Prefix-Suffix Palindrome (Easy version)
|
hashing
string suffix structures
strings
|
1500
|
| 1326-C |
Permutation Partitions
|
combinatorics
greedy
math
|
1300
|
| 1326-B |
Maximums
|
implementation
math
|
900
|
| 1326-A |
Bad Ugly Numbers
|
constructive algorithms
number theory
|
1000
|
| 1325-F |
Ehab's Last Theorem
|
constructive algorithms
dfs and similar
graphs
+1
|
2500
|
| 1325-E |
Ehab's REAL Number Theory Problem
|
brute force
dfs and similar
graphs
+2
|
2600
|
| 1325-D |
Ehab the Xorcist
|
bitmasks
constructive algorithms
greedy
+1
|
1700
|
| 1325-C |
Ehab and Path-etic MEXs
|
constructive algorithms
dfs and similar
greedy
+1
|
1500
|
| 1325-B |
CopyCopyCopyCopyCopy
|
greedy
implementation
|
800
|
| 1325-A |
EhAb AnD gCd
|
constructive algorithms
greedy
number theory
|
800
|
| 1324-F |
Maximum White Subtree
|
dfs and similar
dp
graphs
+1
|
1800
|
| 1324-E |
Sleeping Schedule
|
dp
implementation
|
1700
|
| 1324-D |
Pair of Topics
|
binary search
data structures
sortings
+1
|
1400
|
| 1324-C |
Frog Jumps
|
binary search
data structures
dfs and similar
+2
|
1100
|
| 1324-B |
Yet Another Palindrome Problem
|
brute force
strings
|
1100
|
| 1324-A |
Yet Another Tetris Problem
|
implementation
number theory
|
900
|
| 1323-B |
Count Subrectangles
|
binary search
greedy
implementation
|
1500
|
| 1323-A |
Even Subset Sum Problem
|
brute force
dp
greedy
+1
|
800
|
| 1322-F |
Assigning Fares
|
dp
trees
|
3500
|
| 1322-E |
Median Mountain Range
|
data structures
|
3300
|
| 1322-D |
Reality Show
|
bitmasks
dp
|
2800
|
| 1322-C |
Instant Noodles
|
graphs
hashing
math
+1
|
2300
|
| 1322-B |
Present
|
binary search
bitmasks
constructive algorithms
+3
|
2100
|
| 1322-A |
Unusual Competitions
|
greedy
|
1300
|
| 1321-C |
Remove Adjacent
|
brute force
constructive algorithms
greedy
+1
|
1600
|
| 1321-A |
Contest for Robots
|
greedy
|
900
|
| 1320-F |
Blocks and Sensors
|
brute force
|
3500
|
| 1320-E |
Treeland and Viruses
|
data structures
dfs and similar
dp
+2
|
3000
|
| 1320-D |
Reachable Strings
|
data structures
hashing
strings
|
2500
|
| 1320-C |
World of Darkraft: Battle for Azathoth
|
brute force
data structures
sortings
|
2000
|
| 1320-B |
Navigation System
|
dfs and similar
graphs
shortest paths
|
1700
|
| 1320-A |
Journey Planning
|
data structures
dp
greedy
+2
|
1400
|
| 1316-F |
Battalion Strength
|
data structures
divide and conquer
probabilities
|
2800
|
| 1316-E |
Team Building
|
bitmasks
dp
greedy
+1
|
2300
|
| 1316-D |
Nash Matrix
|
constructive algorithms
dfs and similar
graphs
+1
|
2000
|
| 1316-C |
Primitive Primes
|
constructive algorithms
math
ternary search
|
1800
|
| 1316-B |
String Modification
|
brute force
constructive algorithms
implementation
+2
|
1400
|