@@ -23,5 +23,21 @@ Your submission should be an ordered list of cities, representing the path in wh
- The distance between two cities is calculated as the 2D Euclidean distance.
- Every 10th step (`stepNumber % 10 == 0`) is 10% longer, except when the step is coming from a city with a prime `CityId`.
## Evaluation
Your submission is scored on the Euclidean distance of your submitted path, subject to the constraint that every 10th step is 10% more lengthy unless coming from a prime CityId.
Submission file
Your submission file contains the ordered Path that Santa should use to visit all the cities. Paths must start and end at the North Pole (CityId = 0) and you must visit every city exactly once. Submission files must have a header and should look like:
<code>
Path
0
1
2
...
0
</code>
## Good Luck!
Ensure your solution adheres to the constraints and optimizes the travel path. Happy coding!
