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?
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?
