Name: Range Updates and Sums

problem link : https://cses.fi/problemset/task/1735

code link : https://ideone.com/1wU6WV

What is wrong with my code ??

I was trying a sparse table problem in spoj called Miraculous. The link is: https://www.spoj.com/problems/TNVFC1M/

I was thinking to solve the problem using sparse table . But did not find an idea. So, can anyone help me to solve it or share the main idea of the problem?? Thanks in advance.

UCV2013B — Alice in Amsterdam, I mean Wonderland

This is a graph problem from spoj

Can anyone tell me how to solve it??

Link :https://www.spoj.com/problems/UCV2013B/

Thanks in advance

Hi folks!!! I am learning dynamic programming.I am a newbie. I am learning dp in recursive way. But i find great difficulty in iterative way. And sometimes i face tle or runtime error in recursive specially in cses problem set. So i want to learn dp in iterative way. But don't know how to. Can you guys tell me how to learn dp in iterative way as a beginner?? Thanks in advance.

problem statement: cses grid paths https://cses.fi/problemset/task/1638/ What is wrong with my code?? code: Link to this code: https://cses.fi/paste/d5d85fe7f661fdba3fd8f3/

I have started learning dijkstra algorithm but i can not solve any problem on any ojs. I don't know how to find second shortest path or these kinda problem . I just can figure out shortest path. How can i be an expert on dijkstra algo?