3 replies to this topic

[s1mas]

Hello,
I need help for one task.
It can be complete by programmable language (Pascal, php...) or by other tools (Excel, Mathcad...)
Task need to find a cheapest way from left to right. Can`t drive cornerwise.

exemple
102 734 235 104 21
203 98 352 985 255
742 693 946 638 196
737 599 897 221 976
826 754 574 39 451

203, 98, 352, 235, 104, 21 = 1013 EU

Matrica for this task:
5494 776 6142 7490 7414 884 3257 3119 5847 6288 7550 7675 9394 5229 8398 2745
6503 5908 943 7985 9187 4000 2681 4833 9529 4498 7667 7169 8866 204 2293 2485
9123 5964 5774 3289 2106 9662 6585 5585 4167 5322 855 5599 8756 1870 947 7484
8159 5722 2250 1895 6546 8130 7058 7988 6513 3305 5650 419 7672 1657 7823 9670
2397 3836 2356 4873 4741 9503 7221 8737 4846 6868 8068 3922 7632 5132 8762 1793
2506 77 3213 9948 4681 5682 6219 5463 2447 8064 5821 8233 294 6813 8557 3274
8496 4286 1901 319 7909 6957 8505 6899 940 9721 5941 6669 3187 4556 8585 3402
848 9974 3597 8983 3735 9878 5391 4238 1244 3057 2816 3513 7416 6792 5060 4201
7518 7149 8607 4461 5006 8622 4838 2601 3979 2293 3534 3584 8357 365 5196 5322
141 1127 666 1027 4106 7685 418 579 5745 3754 7998 9003 3184 2713 7262 2724
3322 5976 4582 3761 6422 8273 9081 2146 1982 5308 2962 4016 761 1758 8252 8462
3095 7052 5091 5806 565 8455 9637 1546 8566 1128 9594 3672 4979 4866 2549 456
8534 2042 9894 8236 4364 1816 3062 1153 4416 4506 1546 8056 3244 6428 5078 8970
1004 5453 1184 4338 697 9082 3996 8854 492 8802 1870 4090 6433 1735 2359 5218
2122 5537 235 9441 7127 1349 9888 3243 5558 4129 7899 6407 3381 1842 9811 4651
816 3092 3730 4254 188 4563 356 3938 809 7745 1521 1043 8399 9658 8532 3112


Sorry for my bad English
Thank you

Attached Files

•  task..xml   19.49K   33 downloads

[WingedPanther]

I would recommend you create a second array and use that array to find the cheapest path to each location in your matrix.

[s1mas]

I have no idea how I can do it...:pinguin:

[WingedPanther]

Consider this grid:
102 734 235 104 21
203 98 352 985 255
742 693 946 638 196
737 599 897 221 976
826 754 574 39 451

If you look at the left-hand side, you will want to know the shortest path to get to each of those squares. Obviously, it's:
102 ??? ??? ??? ??
203 ?? ??? ??? ???
742 ??? ??? ??? ???
737 ??? ??? ??? ???
826 ??? ??? ?? ???

So, those minimum distances are known. However, you want to get further to the right. Look at each value in the second column, and determine which one you can get to fastest. It'll be the 98 with a total distance of 301:
102 ??? ??? ??? ??
203 301 ??? ??? ???
742 ??? ??? ??? ???
737 ??? ??? ??? ???
826 ??? ??? ?? ???

Here, I've recorded the TOTAL distance in this second array.