Enter
|
Register
Home
Top
Catalog
Contests
Gym
Problemset
Groups
Rating
Edu
API
Calendar
Help
→ Pay attention
Before contest
Codeforces Round 973 (Div. 2)
13:34:25
Register now »
*has extra registration
→ Filter Problems
Difficulty:
—
divide and conquer
combine-tags-by-or
*combine tags by OR
2-sat
binary search
bitmasks
brute force
chinese remainder theorem
combinatorics
constructive algorithms
data structures
dfs and similar
divide and conquer
dp
dsu
expression parsing
fft
flows
games
geometry
graph matchings
graphs
greedy
hashing
implementation
interactive
math
matrices
meet-in-the-middle
number theory
probabilities
schedules
shortest paths
sortings
string suffix structures
strings
ternary search
trees
two pointers
Add tag
Main
acmsguru
|
Problems
Submit
Status
Standings
Custom test
Problems
#
Name
2006C
Eri and Expanded Sets
data structures
,
divide and conquer
,
math
,
number theory
,
two pointers
2300
x1378
2005D
Alter the GCD
binary search
,
data structures
,
divide and conquer
,
implementation
,
number theory
x553
2003E2
Turtle and Inversions (Hard Version)
brute force
,
data structures
,
divide and conquer
,
dp
,
greedy
,
math
,
two pointers
2700
x451
2003E1
Turtle and Inversions (Easy Version)
brute force
,
divide and conquer
,
dp
,
greedy
,
math
2600
x638
2001C
Guess The Tree
binary search
,
brute force
,
dfs and similar
,
divide and conquer
,
dsu
,
greedy
,
interactive
,
trees
1500
x10002
1998E2
Eliminating Balls With Merging (Hard Version)
binary search
,
brute force
,
data structures
,
divide and conquer
,
greedy
,
implementation
2500
x612
1998E1
Eliminating Balls With Merging (Easy Version)
binary search
,
brute force
,
data structures
,
divide and conquer
,
greedy
2200
x1675
1997E
Level Up
binary search
,
brute force
,
data structures
,
divide and conquer
,
implementation
2200
x2656
1990F
Polygonal Segments
brute force
,
data structures
,
divide and conquer
,
dp
,
greedy
,
two pointers
2800
x256
1990E2
Catch the Mole(Hard Version)
binary search
,
data structures
,
dfs and similar
,
divide and conquer
,
interactive
,
trees
2600
x813
1989F
Simultaneous Coloring
dfs and similar
,
divide and conquer
,
graphs
3000
x431
1988E
Range Minimum Sum
binary search
,
brute force
,
data structures
,
divide and conquer
,
implementation
2300
x1318
1987G2
Spinning Round (Hard Version)
divide and conquer
,
dp
,
trees
3500
x147
1987G1
Spinning Round (Easy Version)
divide and conquer
,
dp
,
trees
2900
x252
1983D
Swap Dilemma
constructive algorithms
,
data structures
,
divide and conquer
,
greedy
,
math
,
sortings
1700
x7864
1982E
Number of k-good subarrays
bitmasks
,
brute force
,
combinatorics
,
divide and conquer
,
dp
,
math
,
meet-in-the-middle
2300
x1499
1976D
Invertible Bracket Sequences
binary search
,
combinatorics
,
data structures
,
divide and conquer
,
implementation
,
two pointers
2000
x4144
1975F
Set
bitmasks
,
brute force
,
combinatorics
,
dfs and similar
,
divide and conquer
,
dp
,
math
2600
x784
1969E
Unique Array
binary search
,
data structures
,
divide and conquer
,
dp
,
greedy
2400
x1305
1957F1
Frequency Mismatch (Easy Version)
binary search
,
data structures
,
divide and conquer
,
hashing
,
probabilities
,
trees
2600
x465
1956D
Nene and the Mex Operator
bitmasks
,
brute force
,
constructive algorithms
,
divide and conquer
,
dp
,
greedy
,
implementation
,
math
2000
x3795
1951E
No Palindromes
brute force
,
constructive algorithms
,
divide and conquer
,
greedy
,
hashing
,
implementation
,
math
,
strings
2000
x3547
1940C
Burenka and Pether
*special problem
,
data structures
,
dfs and similar
,
divide and conquer
,
dsu
,
graphs
,
sortings
,
trees
x35
1936E
Yet Yet Another Permutation Problem
divide and conquer
,
fft
,
math
3400
x111
1930D2
Sum over all Substrings (Hard Version)
bitmasks
,
divide and conquer
,
dp
,
dsu
,
greedy
,
implementation
,
strings
2100
x2581
1922E
Increasing Subsequences
bitmasks
,
constructive algorithms
,
divide and conquer
,
greedy
,
math
1800
x7583
1921G
Mischievous Shooter
brute force
,
data structures
,
divide and conquer
,
dp
,
implementation
2200
x1224
1919G
Tree LGM
constructive algorithms
,
divide and conquer
,
games
,
trees
3500
x179
1918E
ace5 and Task Order
constructive algorithms
,
divide and conquer
,
implementation
,
interactive
,
probabilities
,
sortings
2200
x1698
1916G
Optimizations From Chelsu
divide and conquer
,
dp
,
number theory
,
trees
3500
x147
1915F
Greetings
data structures
,
divide and conquer
,
sortings
1500
x13433
1913D
Array Collapse
data structures
,
divide and conquer
,
dp
,
trees
2100
x3087
1912B
Blueprint for Seating
combinatorics
,
divide and conquer
,
math
2100
x1006
1906K
Deck-Building Game
divide and conquer
,
math
2500
x296
1905F
Field Should Not Be Empty
brute force
,
data structures
,
divide and conquer
2600
x522
1904D2
Set To Max (Hard Version)
constructive algorithms
,
data structures
,
divide and conquer
,
greedy
,
implementation
,
sortings
1800
x4325
1903D2
Maximum And Queries (hard version)
bitmasks
,
divide and conquer
,
dp
,
greedy
2500
x764
1902F
Trees and XOR Queries Again
data structures
,
dfs and similar
,
divide and conquer
,
graphs
,
implementation
,
math
,
trees
2400
x999
1898F
Vova Escapes the Matrix
brute force
,
dfs and similar
,
divide and conquer
,
shortest paths
2600
x811
1896H1
Cyclic Hamming (Easy Version)
brute force
,
divide and conquer
,
dp
,
fft
,
math
,
number theory
3400
x87
1896D
Ones and Twos
binary search
,
data structures
,
divide and conquer
,
math
,
two pointers
1700
x5666
1887D
Split
binary search
,
data structures
,
divide and conquer
,
dsu
,
math
,
trees
,
two pointers
2700
x871
1879D
Sum of XOR Functions
bitmasks
,
combinatorics
,
divide and conquer
,
dp
,
math
1700
x7289
1874D
Jellyfish and Miku
divide and conquer
,
dp
,
math
,
probabilities
2800
x713
1859F
Teleportation in Byteland
data structures
,
dfs and similar
,
divide and conquer
,
graphs
,
shortest paths
,
trees
3200
x397
1857G
Counting Graphs
combinatorics
,
divide and conquer
,
dsu
,
graphs
,
greedy
,
sortings
,
trees
2000
x4415
1856D
More Wrong
divide and conquer
,
interactive
2100
x3234
1849F
XOR Partition
binary search
,
bitmasks
,
data structures
,
divide and conquer
,
greedy
,
trees
2700
x713
1849E
Max to the Right of Min
binary search
,
data structures
,
divide and conquer
,
dp
,
dsu
,
two pointers
2300
x1632
1848F
Vika and Wiki
binary search
,
bitmasks
,
combinatorics
,
divide and conquer
,
dp
,
math
2400
x1532
1843F2
Omsk Metro (hard version)
data structures
,
dfs and similar
,
divide and conquer
,
dp
,
math
,
trees
2300
x1587
1842I
Tenzing and Necklace
divide and conquer
,
dp
,
greedy
3500
x119
1817E
Half-sum
brute force
,
divide and conquer
,
greedy
3400
x260
1814F
Communication Towers
brute force
,
divide and conquer
,
dsu
2700
x612
1808E2
Minibuses on Venus (medium version)
combinatorics
,
divide and conquer
,
dp
,
matrices
2500
x680
1808E1
Minibuses on Venus (easy version)
combinatorics
,
divide and conquer
,
dp
2200
x1321
1804F
Approximate Diameter
binary search
,
divide and conquer
,
graphs
,
shortest paths
2700
x906
1801E
Gasoline prices
data structures
,
divide and conquer
,
dsu
,
hashing
,
trees
3000
x448
1797F
Li Hua and Path
data structures
,
dfs and similar
,
divide and conquer
,
dsu
,
trees
3000
x350
1794D
Counting Factorizations
combinatorics
,
divide and conquer
,
dp
,
math
,
number theory
1900
x3566
1793F
Rebrending
brute force
,
data structures
,
divide and conquer
,
implementation
2600
x1366
1792F2
Graph Coloring (hard version)
brute force
,
combinatorics
,
divide and conquer
,
dp
,
fft
,
graphs
2900
x388
1790F
Timofey and Black-White Tree
brute force
,
dfs and similar
,
divide and conquer
,
graphs
,
greedy
,
math
,
shortest paths
,
trees
2100
x3326
1787I
Treasure Hunt
data structures
,
divide and conquer
,
two pointers
3400
x165
1783G
Weighed Tree Radius
data structures
,
divide and conquer
,
implementation
,
trees
2800
x477
1777F
Comfortably Numb
bitmasks
,
data structures
,
divide and conquer
,
strings
,
trees
2400
x931
1773B
BinCoin
binary search
,
divide and conquer
,
hashing
,
implementation
,
probabilities
,
trees
2200
x762
1770G
Koxia and Bracket
divide and conquer
,
fft
,
math
3400
x158
1766E
Decomposition
binary search
,
brute force
,
data structures
,
divide and conquer
,
dp
,
two pointers
2300
x1180
1750E
Bracket Cost
binary search
,
data structures
,
divide and conquer
,
dp
,
greedy
,
strings
2400
x1406
1748E
Yet Another Array Counting Problem
binary search
,
data structures
,
divide and conquer
,
dp
,
flows
,
math
,
trees
2300
x1880
1741D
Masha and a Beautiful Tree
dfs and similar
,
divide and conquer
,
graphs
,
sortings
,
trees
1300
x15163
1740I
Arranging Crystal Balls
data structures
,
divide and conquer
,
divide and conquer
,
dp
,
geometry
,
graphs
,
number theory
3500
x113
1734F
Zeros and Ones
bitmasks
,
divide and conquer
,
dp
,
math
2500
x795
1730E
Maximums and Minimums
combinatorics
,
data structures
,
divide and conquer
,
number theory
2700
x637
1721D
Maximum AND
bitmasks
,
dfs and similar
,
divide and conquer
,
greedy
,
sortings
1800
x6587
1716E
Swap and Maximum Block
bitmasks
,
data structures
,
dfs and similar
,
divide and conquer
,
dp
2500
x1086
1715E
Long Way Home
data structures
,
divide and conquer
,
dp
,
geometry
,
graphs
,
greedy
,
shortest paths
2400
x1709
1706E
Qpwoeirut and Vertices
binary search
,
data structures
,
dfs and similar
,
divide and conquer
,
dsu
,
greedy
,
trees
2300
x2638
1696D
Permutation Graph
binary search
,
constructive algorithms
,
data structures
,
divide and conquer
,
greedy
,
shortest paths
1900
x5425
1693D
Decinc Dividing
brute force
,
data structures
,
divide and conquer
,
dp
,
greedy
2800
x826
1691D
Max GEQ Sum
binary search
,
constructive algorithms
,
data structures
,
divide and conquer
,
implementation
,
two pointers
1800
x5766
1684H
Hard Cut
constructive algorithms
,
dfs and similar
,
divide and conquer
,
math
3400
x239
1681F
Unique Occurrences
data structures
,
dfs and similar
,
divide and conquer
,
dp
,
dsu
,
trees
2300
x1733
1680F
Lenient Vertex Cover
dfs and similar
,
divide and conquer
,
dsu
,
graphs
,
trees
2600
x661
1676H2
Maximum Crossings (Hard Version)
data structures
,
divide and conquer
,
sortings
1500
x10677
1673F
Anti-Theft Road Planning
bitmasks
,
constructive algorithms
,
divide and conquer
,
greedy
,
interactive
,
math
2400
x814
1671E
Preorder
combinatorics
,
divide and conquer
,
dp
,
dsu
,
hashing
,
sortings
,
trees
2100
x2736
1665E
MinimizOR
bitmasks
,
brute force
,
data structures
,
divide and conquer
,
greedy
,
implementation
,
two pointers
2500
x1514
1663B
Mike's Sequence
*special problem
,
divide and conquer
,
implementation
,
math
x3392
1654H
Three Minimums
combinatorics
,
constructive algorithms
,
divide and conquer
,
dp
,
fft
,
math
3500
x76
1654F
Minimal String Xoration
bitmasks
,
data structures
,
divide and conquer
,
greedy
,
hashing
,
sortings
,
strings
2800
x1187
1648E
Air Reform
data structures
,
dfs and similar
,
divide and conquer
,
dsu
,
graphs
,
implementation
,
trees
3200
x396
1648D
Serious Business
data structures
,
divide and conquer
,
dp
,
implementation
,
shortest paths
2800
x871
1641E
Special Positions
combinatorics
,
divide and conquer
,
fft
,
math
3300
x207
1633F
Perfect Matching
data structures
,
divide and conquer
,
interactive
,
trees
2800
x318
1625E1
Cats on the Upgrade (easy version)
brute force
,
data structures
,
dfs and similar
,
divide and conquer
,
dp
,
graphs
,
trees
2500
x1038
1619H
Permutation and Queries
brute force
,
data structures
,
divide and conquer
,
two pointers
2400
x1134
1616H
Keep XOR Low
bitmasks
,
combinatorics
,
data structures
,
divide and conquer
,
dp
,
math
3000
x911
1615H
Reindeer Games
binary search
,
constructive algorithms
,
data structures
,
divide and conquer
,
flows
,
graphs
,
shortest paths
3000
x326
←
1
2
3
→
User lists
Name