Wait, let me finish this in Java and fix this error
Haskell cannot submit due to the Tab character, could you please remove them in test file.
This kata is not difficult, but it cost me a year to finish it...
I dropped it after several trials at this moment last year, since I couldn't figure out the wrong point.
Glad to solve it today, like a small gift. Nice kata! :D
Add a typedef to your code may solve this.
One of my friends add 40+ honours, then another 142, then 380...
I think this kata could be harder. All the test cases could be passed without any shortest path alogrithm, since the shortest path is just the given sequence, but the kata description didn't say the granny cannot visit a town twice. Maybe change the right angle into a given sequence is better?
Neat solution! :)
The test cases for Haskell are broken, please fix it, thanks!
And I think the introduction should include more details about 19:00.
Thanks for your excellent explanation!
In Chinese, it was named '龟兔赛跑' ~ :-)
Good Kata in my opinion, keep it up. I ranked it 8kyu.
I think the description is still a little confused. Maybe if only 0 after the decimal point could be better?
if only 0 after the decimal point
This comment is hidden because it contains spoiler information about the solution