3.3 KiB
Problem List
A little collection of interesting problems that I randomly decided to do.
Ad-hoc/Greedy
-
B. Gellyfish and Baby's Breath
Cool ad-hoc problem, a little of math but mostly greedy.
-
One of the most annoying problem I did, good to prepare for the future hell.
-
Another incredibly annoying problem, beware...
Data structures
-
Can be solved with two sets or binary search with sparse table.
-
D. Kevin and Competition Memories
Another interesting sparse table problem, I'm not sure it needs one, but I solved with one.
-
Another sparse table problem.
-
Can be solved with sparse table or coordinate compression with prefix sum.
-
Can be solved in two ways, but the sparse table one is interesting, although the other way seems more versatile.
Reroot
-
Interesting reroot problem, there's not much for me to say about it.
DP
-
It's cool to think about this problem, it has an interesting way to solve.
-
D. Inversion Value of a Permutation
Now THIS is a problem you have to think outside the box!
-
Interesting LIS problem.
-
Knapsack based on weight problem, classic.
-
Classic matrix exponentiation problem.
-
Amazing knapsack problem, really satisfying to do!
-
An interesting way to learn how to visualize a DP as a graph and optmize it using matrix exponentiation.
-
A bit basic DP problem, but still interesting to think about all the possible cases and make a DP about it.
-
Cool DP problem, you have to understand knapsack to do and optmize it.
-
G. Mukhammadali and the Smooth Array
Pretty simple, but requires optmization.
-
Basic problem about matrix exponentation, but not as obvious.
Graph
-
Cool graph problem, not exactly difficult, but interesting to think about it.
Math
-
E2. Rudolf and Snowflakes (hard version)
Not so hard if you know how to deal with C++ or any other language with big integer, but it's interesting to think about regardless, can also be solved with a binary search, but it's not required.