| 251-B |
Playing with Permutations
|
implementation
math
|
1800
|
| 251-A |
Points on Line
|
binary search
combinatorics
two pointers
|
1300
|
| 250-E |
Mad Joe
|
brute force
|
2000
|
| 250-D |
Building Bridge
|
geometry
ternary search
two pointers
|
1900
|
| 250-C |
Movie Critics
|
greedy
|
1600
|
| 250-B |
Restoring IPv6
|
implementation
strings
|
1500
|
| 250-A |
Paper Work
|
greedy
|
1000
|
| 249-E |
Endless Matrix
|
math
|
2600
|
| 249-D |
Donkey and Stars
|
data structures
dp
geometry
+2
|
2700
|
| 248-E |
Piglet's Birthday
|
dp
math
probabilities
|
2600
|
| 248-D |
Sweets for Everyone!
|
binary search
greedy
implementation
|
2300
|
| 248-C |
Robo-Footballer
|
binary search
geometry
|
2000
|
| 248-B |
Chilly Willy
|
math
number theory
|
1400
|
| 248-A |
Cupboards
|
implementation
|
800
|
| 246-E |
Blood Cousins Return
|
binary search
data structures
dfs and similar
+2
|
2400
|
| 246-D |
Colorful Graph
|
brute force
dfs and similar
graphs
|
1600
|
| 246-C |
Beauty Pageant
|
brute force
constructive algorithms
greedy
|
1600
|
| 246-B |
Increase and Decrease
|
greedy
math
|
1300
|
| 246-A |
Buggy Sorting
|
constructive algorithms
greedy
sortings
|
900
|
| 245-H |
Queries for Number of Palindromes
|
dp
hashing
strings
|
1800
|
| 245-G |
Suggested Friends
|
brute force
graphs
|
2200
|
| 245-F |
Log Stream Analysis
|
binary search
brute force
implementation
+1
|
2000
|
| 245-E |
Mishap in Club
|
greedy
implementation
|
1400
|
| 245-D |
Restoring Table
|
constructive algorithms
greedy
|
1500
|
| 245-C |
Game with Coins
|
greedy
|
1700
|
| 245-B |
Internet Address
|
implementation
strings
|
1100
|
| 245-A |
System Administrator
|
implementation
|
800
|
| 244-B |
Undoubtedly Lucky Numbers
|
bitmasks
brute force
dfs and similar
|
1600
|
| 244-A |
Dividing Orange
|
implementation
|
900
|
| 243-E |
Matrix
|
data structures
|
3000
|
| 243-D |
Cubes
|
data structures
dp
geometry
+1
|
2700
|
| 243-C |
Colorado Potato Beetle
|
dfs and similar
implementation
|
2200
|
| 243-B |
Hydra
|
graphs
sortings
|
2000
|
| 243-A |
The Brand New Function
|
bitmasks
|
1600
|
| 242-E |
XOR on Segment
|
bitmasks
data structures
|
2000
|
| 242-D |
Dispute
|
dfs and similar
graphs
greedy
|
2100
|
| 242-C |
King's Path
|
dfs and similar
graphs
hashing
+1
|
1800
|
| 242-B |
Big Segment
|
implementation
sortings
|
1100
|
| 242-A |
Heads or Tails
|
brute force
implementation
|
1100
|
| 241-G |
Challenging Balloons
|
constructive algorithms
|
1900
|
| 241-F |
Race
|
brute force
implementation
|
2300
|
| 241-E |
Flights
|
graphs
shortest paths
|
2600
|
| 241-D |
Numbers
|
|
2900
|
| 241-C |
Mirror Box
|
geometry
implementation
|
2000
|
| 241-B |
Friends
|
binary search
bitmasks
data structures
+1
|
2700
|
| 241-A |
Old Peykan
|
greedy
|
1300
|
| 240-F |
TorCoder
|
data structures
|
2600
|
| 240-E |
Road Repairs
|
dfs and similar
graphs
greedy
|
2800
|
| 239-B |
Easy Tape Programming
|
brute force
implementation
|
1500
|
| 239-A |
Two Bags of Potatoes
|
greedy
implementation
math
|
1200
|