OJ Board

just add 'mod[0]++;' after res=0

Can you share more tests , please ? I pass all the tests on the board and from the problem statement , and still I can't AC it.

Thanks in advance !

Don't worry dude !
If you still have problems after Tanu's private message ask here..

I think you actually got the right algorithm for Camelot , but try to do it with bfs , because this recursion does many stack calls. And posting the whole matrix and so many variables .. only fills the stack , I don't know how much memory does it need. And the bfs finds the optimal way when you ...

Do a bfs from the startx,starty , generate all the possible next positions and if they are not visited enqueue them and so on , keep the distance to D[x][y]. when you pop the position you are interested in stop the bfs and output it's distance....

rushel , you are underestimating the problem , it's not that easy.

Isn't there a trickier and faster way to solve this problem ? Cause this seems too much brute force to me , is this the way to solve this kind of problems ? Thank you in advance !

P.S. I just was hoping for something really clever

It is a travelling salesman problem

Thank you for your reply , I did it the same way .. but a friend told me that it could be done with topological sorting(if someone knows how it is done with top. sorting please tell) , this is why I asked you Anyway , thank you !

Timo , did you use the dfs for making a topological sort ? If yes , after this how did you count the value for every vertex ?

To see if some numbers make some SUM , use DP ! It is a standart algorithm - making of sum from some coins. Ask if you have any further questions:)

Thank you for your support.
I figured out the DP solution and am happy now

Hello , I cannot figure out the solution , and when the problem is considered as an easy one I am getting little frustrated ( there probably is something very little which I can't see ) :( Please help me to get out of this situation. This is the solution I coded , but it appears to be wrong. I don't ...

Thank you I will try it

I have recently studied the sweeping technique and am excited about it. I want to try solving some problems with it . Any suggestions ? ( Some problem names/numbers - from UVa , IOI/BOI/CeOI .. doesn't matters as long as it is solveable by sweeping).

Thank you in advance!