Enter
|
Register
Home
Top
Catalog
Contests
Gym
Problemset
Groups
Rating
Edu
API
Calendar
Help
Main
acmsguru
|
Problems
Submit
Status
Standings
Custom test
Problems
#
Name
1006E
Military Problem
dfs and similar
,
graphs
,
trees
1600
x9453
1006D
Two Strings Swaps
implementation
1700
x5858
1006C
Three Parts of the Array
binary search
,
data structures
,
two pointers
1200
x20326
1006B
Polycarp's Practice
greedy
,
implementation
,
sortings
1200
x12843
1006A
Adjacent Replacements
implementation
800
x21188
1005F
Berland and the Shortest Paths
brute force
,
dfs and similar
,
graphs
,
shortest paths
2100
x1616
1005E2
Median on Segments (General Case Edition)
sortings
2400
x1212
1005E1
Median on Segments (Permutations Edition)
sortings
1800
x3723
1005D
Polycarp and Div 3
dp
,
greedy
,
number theory
1500
x9845
1005C
Summarize to the Power of Two
brute force
,
greedy
,
implementation
1300
x11332
1005B
Delete from the Left
brute force
,
implementation
,
strings
900
x22405
1005A
Tanya and Stairways
implementation
800
x23081
1004F
Sonya and Bitwise OR
bitmasks
,
data structures
,
divide and conquer
2600
x704
1004E
Sonya and Ice Cream
binary search
,
data structures
,
dp
,
greedy
,
shortest paths
,
trees
2400
x1010
1004D
Sonya and Matrix
brute force
,
constructive algorithms
,
implementation
2300
x1390
1004C
Sonya and Robots
constructive algorithms
,
implementation
1400
x7438
1004B
Sonya and Exhibition
constructive algorithms
,
greedy
,
implementation
,
math
1300
x9215
1004A
Sonya and Hotels
implementation
900
x10974
1003F
Abbreviation
dp
,
hashing
,
strings
2200
x1101
1003E
Tree Constructing
constructive algorithms
,
graphs
2100
x2435
1003D
Coins and Queries
greedy
1600
x7536
1003C
Intense Heat
brute force
,
implementation
,
math
1300
x10352
1003B
Binary String Constructing
constructive algorithms
1300
x11062
1003A
Polycarp's Pockets
implementation
800
x26478
1002E2
Another array reconstruction algorithm
1900
x198
1002E1
Bernstein-Vazirani algorithm
1500
x317
1002D3
Oracle for majority function
1600
x327
1002D2
Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2
1300
x372
1002D1
Oracle for f(x) = b * x mod 2
1200
x398
1002C2
Distinguish zero state and plus state without errors
1800
x262
1002C1
Distinguish zero state and plus state with minimum error
1700
x298
1002B4
Distinguish four 2-qubit states - 2
1700
x304
1002B3
Distinguish four 2-qubit states
1600
x405
1002B2
Distinguish GHZ state and W state
1600
x440
1002B1
Distinguish zero state and W state
1300
x472
1002A4
Generate W state
1900
x261
1002A3
Generate superposition of two basis states
1500
x469
1002A2
Generate superposition of zero state and a basis state
1300
x551
1002A1
Generate superposition of all basis states
800
x822
1001I
Deutsch-Jozsa algorithm
*special problem
1700
x397
1001H
Oracle for f(x) = parity of the number of 1s in x
*special problem
1200
x526
1001G
Oracle for f(x) = k-th element of x
*special problem
1400
x532
1001F
Distinguish multi-qubit basis states
*special problem
1300
x532
1001E
Distinguish Bell states
*special problem
1600
x553
1001D
Distinguish plus state and minus state
*special problem
1400
x676
1001C
Generate GHZ state
*special problem
1400
x647
1001B
Generate Bell state
*special problem
1400
x705
1001A
Generate plus state or minus state
*special problem
1100
x1003
1000G
Two-Paths
data structures
,
dp
,
trees
2700
x556
1000F
One Occurrence
data structures
,
divide and conquer
2400
x3530
1000E
We Need More Bosses
dfs and similar
,
graphs
,
trees
2100
x3960
1000D
Yet Another Problem On a Subsequence
combinatorics
,
dp
1900
x3974
1000C
Covered Points Count
data structures
,
implementation
,
sortings
1700
x6444
1000B
Light It Up
greedy
1500
x5592
1000A
Codehorses T-shirts
greedy
,
implementation
1200
x8590
999F
Cards and Joy
dp
2000
x2536
999E
Reachability from the Capital
dfs and similar
,
graphs
,
greedy
2000
x6374
999D
Equalize the Remainders
data structures
,
greedy
,
implementation
1900
x4164
999C
Alphabetic Removals
implementation
1200
x17356
999B
Reversing Encryption
implementation
900
x17137
999A
Mishka and Contest
brute force
,
implementation
800
x22304
998B
Cutting
dp
,
greedy
,
sortings
1200
x12764
998A
Balloons
constructive algorithms
,
implementation
1000
x9193
997E
Good Subsegments
data structures
3000
x1085
997D
Cycles in product
combinatorics
,
divide and conquer
,
trees
2900
x424
997C
Sky Full of Stars
combinatorics
,
math
2500
x1637
997B
Roman Digits
brute force
,
combinatorics
,
dp
,
greedy
,
math
2000
x2857
997A
Convert to Ones
brute force
,
greedy
,
implementation
,
math
1500
x8166
996B
World Cup
binary search
,
math
1300
x8856
996A
Hit the Lottery
dp
,
greedy
800
x84620
995F
Cowmpany Cowmpensation
combinatorics
,
dp
,
math
,
trees
2700
x1123
995E
Number Clicker
divide and conquer
,
graphs
,
meet-in-the-middle
,
number theory
2700
x616
995D
Game
math
2500
x745
995C
Leaving the Bar
brute force
,
data structures
,
geometry
,
greedy
,
math
,
sortings
2300
x1730
995B
Suit and Tie
greedy
,
implementation
,
math
1400
x7017
995A
Tesla
constructive algorithms
,
implementation
2100
x1504
994B
Knights of a Polygonal Table
greedy
,
implementation
,
sortings
1400
x5541
994A
Fingerprints
implementation
800
x13896
993F
The Moral Dilemma
3200
x59
993E
Nikita and Order Statistics
chinese remainder theorem
,
fft
,
math
2300
x1363
993D
Compute Power
binary search
,
dp
,
greedy
2500
x593
993C
Careful Maneuvering
bitmasks
,
brute force
,
geometry
2100
x1480
993B
Open Communication
bitmasks
,
brute force
1900
x1930
993A
Two Squares
geometry
,
implementation
1600
x3883
992E
Nastya and King-Shamans
binary search
,
data structures
2500
x1268
992D
Nastya and a Game
brute force
,
implementation
,
math
2100
x1597
992C
Nastya and a Wardrobe
math
1600
x4513
992B
Nastya Studies Informatics
math
,
number theory
1600
x6110
992A
Nastya and an Array
implementation
,
sortings
800
x12911
991F
Concise and clear
brute force
,
greedy
,
implementation
,
math
2700
x294
991E
Bus Number
brute force
,
combinatorics
,
math
1800
x3411
991D
Bishwock
dp
,
greedy
1500
x7008
991C
Candies
binary search
,
implementation
1500
x10034
991B
Getting an A
greedy
,
sortings
900
x12331
991A
If at first you don't succeed...
implementation
1000
x10394
990G
GCD Counting
divide and conquer
,
dp
,
dsu
,
number theory
,
trees
2400
x1734
990F
Flow Control
dfs and similar
,
dp
,
greedy
,
trees
2400
x871
990E
Post Lamps
brute force
,
greedy
2100
x1974
990D
Graph And Its Complement
constructive algorithms
,
graphs
,
implementation
1700
x3757
990C
Bracket Sequences Concatenation Problem
implementation
1500
x5802
←
1
2
...
51
52
53
54
55
...
95
96
→
→ Pay attention
Before contest
Codeforces Round 946 (Div. 3)
3 days
Register now »
→ Filter Problems
Difficulty:
—
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
User lists
Name