A few moments ago, we witness an impressive singing performance by our star demoralizer.

This makes me curious to know about special talents of other Red coders as well.

Special Request for demoralizer: A DANCE PERFORMANCE AT 5K SUBS :P

Hey all, Hope you are doing great.

Yesterday, I participated in the Global Round 12 and I had a hard time implementing problem D, but I managed to finish it in time. When I submit, Got TLE on test 2. With only two minutes remaining, I panicked and couldn't figure out the bug. Afterward, I go through the code, and guess what, while precomputation, I accidentally used N(= 3e5 + 5) instead of given n.

Due to this, I missed becoming Blue :(

So, the lesson of the story is "Always use MAXN instead of N" for setting max value.

If any of you have similar experiences, please consider sharing. It will be helpful in avoiding those mistakes in the future.

Hey all, Hope you are doing great. Recently, I started with Dynamic programming but got stuck in the Problem called "TETRAHEDRON":

Link for the Problem: https://mirror.codeforces.com/contest/166/problem/E

I tried my best but was not able to get rid of the Memory limit exceed. Here is my Solution: https://mirror.codeforces.com/contest/166/submission/81951399

Can anyone please help me in solving this problem using the above approach or suggest something better which uses dp?