| 1593-D1 |
All are Same
|
math
number theory
|
1100
|
| 1593-C |
Save More Mice
|
binary search
greedy
|
1000
|
| 1593-B |
Make it Divisible by 25
|
dfs and similar
dp
greedy
+1
|
900
|
| 1593-A |
Elections
|
math
|
800
|
| 1592-F2 |
Alice and Recoloring 2
|
constructive algorithms
flows
graph matchings
+1
|
2800
|
| 1592-F1 |
Alice and Recoloring 1
|
constructive algorithms
greedy
|
2600
|
| 1592-E |
Bored Bakry
|
bitmasks
greedy
math
+1
|
2400
|
| 1592-D |
Hemose in ICPC ?
|
binary search
dfs and similar
implementation
+4
|
2300
|
| 1592-C |
Bakry and Partitioning
|
bitmasks
constructive algorithms
dfs and similar
+3
|
1700
|
| 1592-B |
Hemose Shopping
|
constructive algorithms
dsu
math
+1
|
1200
|
| 1592-A |
Gamer Hemose
|
binary search
greedy
math
+1
|
800
|
| 1588-F |
Jumping Through the Array
|
binary search
data structures
graphs
+1
|
3500
|
| 1586-I |
Omkar and Mosaic
|
combinatorics
constructive algorithms
math
|
3500
|
| 1585-G |
Poachers
|
dp
games
graphs
+1
|
2500
|
| 1585-F |
Non-equal Neighbours
|
combinatorics
dp
math
|
2400
|
| 1585-E |
Frequency Queries
|
data structures
dfs and similar
trees
|
2400
|
| 1585-D |
Yet Another Sorting Problem
|
data structures
math
|
1900
|
| 1585-C |
Minimize Distance
|
greedy
|
1300
|
| 1585-B |
Array Eversion
|
greedy
|
900
|
| 1585-A |
Life of a Flower
|
implementation
|
800
|
| 1584-G |
Eligible Segments
|
geometry
|
3200
|
| 1584-F |
Strange LCS
|
bitmasks
dp
graphs
+2
|
2600
|
| 1584-E |
Game with Stones
|
binary search
data structures
games
+1
|
2300
|
| 1584-D |
Guess the Permutation
|
binary search
combinatorics
interactive
+1
|
2000
|
| 1584-C |
Two Arrays
|
greedy
math
sortings
|
900
|
| 1584-B |
Coloring Rectangles
|
greedy
math
|
1000
|
| 1584-A |
Mathematical Addition
|
math
|
800
|
| 1583-H |
Omkar and Tours
|
data structures
divide and conquer
sortings
+1
|
3300
|
| 1583-G |
Omkar and Time Travel
|
data structures
math
|
3000
|
| 1583-F |
Defender of Childhood Dreams
|
bitmasks
constructive algorithms
divide and conquer
|
2500
|
| 1583-E |
Moment of Bloom
|
constructive algorithms
dfs and similar
graph matchings
+3
|
2200
|
| 1583-D |
Omkar and the Meaning of Life
|
constructive algorithms
greedy
interactive
|
1800
|
| 1583-C |
Omkar and Determination
|
data structures
dp
|
1700
|
| 1583-B |
Omkar and Heavenly Tree
|
constructive algorithms
trees
|
1200
|
| 1583-A |
Windblume Ode
|
math
number theory
|
800
|
| 1582-G |
Kuzya and Homework
|
data structures
number theory
|
2600
|
| 1582-F2 |
Korney Korneevich and XOR (hard version)
|
binary search
brute force
dp
+2
|
2400
|
| 1582-F1 |
Korney Korneevich and XOR (easy version)
|
bitmasks
dp
greedy
|
1800
|
| 1582-E |
Pchelyonok and Segments
|
binary search
data structures
dp
+2
|
2000
|
| 1582-D |
Vupsen, Pupsen and 0
|
constructive algorithms
math
|
1600
|
| 1582-C |
Grandma Capa Knits a Scarf
|
brute force
data structures
greedy
+2
|
1200
|
| 1582-B |
Luntik and Subsequences
|
combinatorics
math
|
900
|
| 1582-A |
Luntik and Concerts
|
math
|
800
|
| 1581-B |
Diameter of Graph
|
constructive algorithms
graphs
greedy
+1
|
1200
|
| 1581-A |
CQXYM Count Permutations
|
combinatorics
math
number theory
|
800
|
| 1580-F |
Problems for Codeforces
|
combinatorics
fft
math
|
3300
|
| 1580-E |
Railway Construction
|
brute force
constructive algorithms
data structures
+2
|
3400
|
| 1580-D |
Subsequence
|
brute force
divide and conquer
dp
+2
|
2900
|
| 1580-C |
Train Maintenance
|
brute force
data structures
implementation
|
2200
|
| 1580-B |
Mathematics Curriculum
|
brute force
combinatorics
dp
+1
|
2600
|