README.md

# Traveling Santa Problem

## Overview
<table>
 <tr>
    <!-- Image Column -->
    <td>
    <img src="00_data/RJ_santa.jpeg"  width="200">
    </td>
    <!-- Text Column -->
    <td>
        In this challenge, you are provided with a list of cities and their coordinates in `cities.csv`. Your task is to create the shortest possible path that visits all the cities. 

    </td>
</table>

## Submission File
Your submission should be an ordered list of cities, representing the path in which you visit each city.

## Path Constraints
- Paths must start and end at the North Pole (`CityId = 0`).
- You must visit every city exactly once.
- 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!