Suppose you go from x-y coordinates [3,4] to [0,0] to [0,1] to [1,1], then you walked 7 units of distance.
better to describe input size: xy 4-by-2, each row is the xy-coordinate of a point
Needs a richer test suite. A lot of "solvers" have just put a=7 as the "solution", but although this satisfies the single test case, it doesn't solve the problem as stated.
This could be quite a good solution, if you removed the "x = 7; %" part and just left what is now a comment. As it is, although it satisfies the test case, it doesn't actually solve the problem.
... though, just to be clear, the comment wouldn't be quite right, it still needs a little adjustment.
Project Euler: Problem 5, Smallest multiple
Back to basics 13 - Input variables
Implement simple rotation cypher
cos for boss?
Use of regexp
Distance walked 3D
How many jokers?
Sorted highest to lowest?
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office