HSCTF 9 – Traveling Salesman

Here is the task:

Here are the interaction details:

Here is an example interaction:

In essence, this challenge was not that tough, and that is why it was one of the most solved challenges in the competition. There are a few things that you can do:

  1. List the order from least to greatest
  2. List the order from greatest to least
  3. List it in any way such that the salesman will go from 1- 99 and back without ever going the opposite direction

This challenge does not necessarily require any coding, but you could create your own sorter, which makes this challenge much easier, as eventually the array of integers has 30 integers, which could be a hassle to sort through.

Anyways, that is all from me for now. I hope you guys at least learned something today, and that you all have a great day!

By:

Posted in:


Leave a comment