| 1169-A |
Circle Metro
|
implementation
math
|
900
|
| 1168-E |
Xor Permutations
|
constructive algorithms
math
|
3100
|
| 1168-D |
Anagram Paths
|
dp
implementation
trees
|
3000
|
| 1168-C |
And Reachability
|
bitmasks
dp
|
2200
|
| 1168-B |
Good Triple
|
brute force
two pointers
|
1900
|
| 1168-A |
Increasing by Modulo
|
binary search
greedy
|
1700
|
| 1167-G |
Low Budget Inception
|
brute force
geometry
|
3100
|
| 1167-F |
Scalar Queries
|
combinatorics
data structures
math
+1
|
2300
|
| 1167-E |
Range Deleting
|
binary search
combinatorics
data structures
+1
|
2100
|
| 1167-D |
Bicolored RBS
|
constructive algorithms
greedy
|
1500
|
| 1167-C |
News Distribution
|
dfs and similar
dsu
graphs
|
1400
|
| 1167-B |
Lost Numbers
|
brute force
divide and conquer
interactive
+1
|
1400
|
| 1167-A |
Telephone Number
|
brute force
greedy
strings
|
800
|
| 1166-F |
Vicky's Delivery Service
|
data structures
dsu
graphs
+1
|
2400
|
| 1166-E |
The LCMs Must be Large
|
bitmasks
brute force
constructive algorithms
+2
|
2100
|
| 1166-D |
Cute Sequences
|
binary search
brute force
greedy
+1
|
2200
|
| 1166-C |
A Tale of Two Lands
|
binary search
sortings
two pointers
|
1500
|
| 1166-B |
All the Vowels Please
|
constructive algorithms
math
number theory
|
1100
|
| 1166-A |
Silent Classroom
|
combinatorics
greedy
|
900
|
| 1165-F2 |
Microtransactions (hard version)
|
binary search
greedy
implementation
|
2000
|
| 1165-F1 |
Microtransactions (easy version)
|
binary search
greedy
|
2000
|
| 1165-E |
Two Arrays and Sum of Functions
|
greedy
math
sortings
|
1600
|
| 1165-D |
Almost All Divisors
|
math
number theory
|
1600
|
| 1165-C |
Good String
|
greedy
|
1300
|
| 1165-B |
Polycarp Training
|
data structures
greedy
sortings
|
1000
|
| 1165-A |
Remainder
|
implementation
math
|
1100
|
| 1163-F |
Indecisive Taxi Fee
|
data structures
graphs
shortest paths
|
3000
|
| 1163-E |
Magical Permutation
|
bitmasks
brute force
constructive algorithms
+3
|
2400
|
| 1163-D |
Mysterious Code
|
dp
strings
|
2100
|
| 1163-C2 |
Power Transmission (Hard Edition)
|
data structures
geometry
implementation
+1
|
1900
|
| 1163-C1 |
Power Transmission (Easy Edition)
|
brute force
geometry
|
1900
|
| 1163-B2 |
Cat Party (Hard Edition)
|
data structures
implementation
|
1600
|
| 1163-B1 |
Cat Party (Easy Edition)
|
data structures
implementation
|
1500
|
| 1163-A |
Eating Soup
|
greedy
math
|
900
|
| 1162-B |
Double Matrix
|
brute force
greedy
|
1400
|
| 1162-A |
Zoning Restrictions Again
|
implementation
|
800
|
| 1160-A2 |
Collaboration
|
*special
|
—
|
| 1159-B |
Expansion coefficient of the array
|
implementation
math
|
1300
|
| 1159-A |
A pile of stones
|
implementation
math
|
800
|
| 1158-F |
Density of subarrays
|
dp
math
|
3500
|
| 1158-E |
Strange device
|
binary search
interactive
math
+1
|
3400
|
| 1158-D |
Winding polygonal line
|
constructive algorithms
geometry
greedy
+1
|
2600
|
| 1158-C |
Permutation recovery
|
constructive algorithms
data structures
dfs and similar
+4
|
2100
|
| 1158-B |
The minimal unique substring
|
constructive algorithms
math
strings
|
2200
|
| 1158-A |
The Party and Sweets
|
binary search
constructive algorithms
greedy
+4
|
1500
|
| 1157-G |
Inverse of Rows and Columns
|
brute force
constructive algorithms
|
2200
|
| 1157-F |
Maximum Balanced Circle
|
constructive algorithms
dp
greedy
+1
|
2000
|
| 1157-E |
Minimum Array
|
binary search
data structures
greedy
|
1700
|
| 1157-D |
N Problems During K Days
|
constructive algorithms
greedy
math
|
1900
|
| 1157-C2 |
Increasing Subsequence (hard version)
|
greedy
|
1700
|