| 645-A |
Amity Assessment
|
brute force
constructive algorithms
implementation
|
1200
|
| 644-C |
Hostname Aliases
|
*special
binary search
data structures
+3
|
2100
|
| 644-B |
Processing Queries
|
*special
constructive algorithms
data structures
+1
|
1700
|
| 644-A |
Parliament of Berland
|
*special
constructive algorithms
|
1000
|
| 643-G |
Choosing Ads
|
data structures
|
3200
|
| 643-F |
Bears and Juice
|
dp
math
meet-in-the-middle
|
2900
|
| 643-E |
Bear and Destroying Subtrees
|
dp
math
probabilities
+1
|
2700
|
| 643-D |
Bearish Fanpages
|
|
2900
|
| 643-C |
Levels and Regions
|
dp
|
2400
|
| 643-B |
Bear and Two Paths
|
constructive algorithms
graphs
|
1600
|
| 643-A |
Bear and Colors
|
implementation
|
1500
|
| 641-G |
Little Artem and Graph
|
|
2300
|
| 641-F |
Little Artem and 2-SAT
|
|
3000
|
| 641-E |
Little Artem and Time Machine
|
data structures
|
2000
|
| 641-D |
Little Artem and Random Variable
|
dp
implementation
math
+1
|
2400
|
| 641-C |
Little Artem and Dance
|
brute force
constructive algorithms
implementation
|
1800
|
| 641-B |
Little Artem and Matrix
|
implementation
|
1400
|
| 641-A |
Little Artem and Grasshopper
|
implementation
|
1000
|
| 639-F |
Bear and Chemistry
|
data structures
dfs and similar
graphs
+1
|
3300
|
| 639-E |
Bear and Paradox
|
binary search
greedy
math
+1
|
2800
|
| 639-D |
Bear and Contribution
|
data structures
greedy
sortings
+1
|
2400
|
| 639-C |
Bear and Polynomials
|
hashing
implementation
math
|
2200
|
| 639-B |
Bear and Forgotten Tree 3
|
constructive algorithms
graphs
trees
|
1600
|
| 639-A |
Bear and Displayed Friends
|
implementation
|
1200
|
| 638-D |
Three-dimensional Turtle Super Computer
|
brute force
dfs and similar
graphs
|
1800
|
| 638-C |
Road Improvement
|
*special
dfs and similar
graphs
+2
|
1800
|
| 638-B |
Making Genome in Berland
|
*special
dfs and similar
strings
|
1500
|
| 638-A |
Home Numbers
|
*special
constructive algorithms
math
|
1100
|
| 637-D |
Running with Obstacles
|
*special
data structures
dp
+1
|
1600
|
| 637-C |
Promocodes with Mistakes
|
*special
brute force
constructive algorithms
+1
|
1400
|
| 637-B |
Chat Order
|
*special
binary search
constructive algorithms
+2
|
1200
|
| 637-A |
Voting for Photos
|
*special
constructive algorithms
implementation
|
1000
|
| 635-A |
Orchestra
|
brute force
implementation
|
1100
|
| 634-A |
Island Puzzle
|
constructive algorithms
implementation
|
1300
|
| 633-H |
Fibonacci-ish II
|
data structures
implementation
|
3100
|
| 633-G |
Yash And Trees
|
bitmasks
data structures
dfs and similar
+2
|
2800
|
| 633-F |
The Chocolate Spree
|
dfs and similar
dp
graphs
+1
|
2600
|
| 633-E |
Startup Funding
|
binary search
constructive algorithms
data structures
+2
|
2400
|
| 633-D |
Fibonacci-ish
|
brute force
dp
hashing
+2
|
2000
|
| 633-C |
Spy Syndrome 2
|
data structures
dp
hashing
+4
|
1900
|
| 633-B |
A Trivial Problem
|
brute force
constructive algorithms
math
+1
|
1300
|
| 633-A |
Ebony and Ivory
|
brute force
math
number theory
|
1100
|
| 632-F |
Magic Matrix
|
brute force
divide and conquer
graphs
+2
|
2400
|
| 632-E |
Thief in a Shop
|
divide and conquer
dp
fft
+1
|
2400
|
| 632-D |
Longest Subsequence
|
brute force
math
number theory
|
2100
|
| 632-C |
The Smallest String Concatenation
|
sortings
strings
|
1700
|
| 632-B |
Alice, Bob, Two Teams
|
brute force
constructive algorithms
|
1400
|
| 632-A |
Grandma Laura and Apples
|
|
1200
|
| 631-E |
Product Sum
|
data structures
dp
geometry
|
2600
|
| 631-D |
Messenger
|
data structures
hashing
implementation
+2
|
2100
|