We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
finally beat it.
Well, only had to go Dijkstra with binary insertion.
Well, C# is a pain with sortedset only supporting unique value sorting (providing a custom Icomparer will not work, and break things :-/) so had to use List.
Well any insight on sortedset or if someone beat it in python :-)
Project Euler #83: Path sum: four ways
You are viewing a single comment's thread. Return to all comments →
finally beat it. Well, only had to go Dijkstra with binary insertion. Well, C# is a pain with sortedset only supporting unique value sorting (providing a custom Icomparer will not work, and break things :-/) so had to use List. Well any insight on sortedset or if someone beat it in python :-)