# Supply Stations

Simple+
English

“Do not let your fire go out, spark by irreplaceable spark in the hopeless swamps of the not-quite, the not-yet, and the not-at-all. Do not let the hero in your soul perish in lonely frustration for the life you deserved and have never been able to reach. The world you desire can be won. It exists.. it is real.. it is possible.. it's yours.”
-- "Atlas Shrugged" by Ayn Rand

We need to supply our new factory with four various resources from four different stations. For simplicity we will name them 1st, 2nd, 3rd and 4th resources (we can leave the rest up to your imagination). For this we will need to calculate four routes from the supply stations to the factory. Trucks will must deliver our supplies without stopping and we can not build several layers roads. So the truck routes should not intersect.

You are given a rectangular map divided by square cells. The map is represented as a sequence of strings, where:
- "." is a clear cell;
- "X" is an obstacle (forest, lake, etc);
- "1", "2", "3" or "4" are supply stations;
- "F" is a factory.

You are given a rectangular map divided by square cells. The map is represented as a sequence of strings, where:
- "N" north (up);
- "S" south (down);
- "E" east (right);
- "W" west (left);
A route will be represented as a string with these letters. The result should be as a sequence (list or tuple) of four routes from 1st to 4th.

For the given example (image) the result will be described as:

```["NEEEESSSWS",
"WSSSSSSSEEENNNNEN,
"NNNNEE",
"NNNNWWWW"]
```

Input: The map as a tuple of strings.

Output: The routes as a tuple/list of strings.

Example:

```supply_routes(("..........",
".1X.......",
".2X.X.....",
".XXX......",
".X..F.....",
".X........",
".X..X.....",
".X..X.....",
"..3.X...4.",
"....X....."))
```

How it is used: This algorithm which you will write can serve as a foundation for software that designs circuit boards, or as a simple traffic management system.

Precondition:
All test cases are solvable.
5 ≤ len(the_map) ≤ 10
all(5 ≤ len(row) ≤ 10 for row in the_map)

45
Settings
Code:
Other:
Invalid hot key. Each hot key should be unique and valid
Hot keys:
•  to Run Code: to Check Solution: to Stop:
CheckiO Extensions

CheckiO Extensions allow you to use local files to solve missions. More info in a blog post.

In order to install CheckiO client you'll need installed Python (version at least 3.8)

Install CheckiO Client first:

`pip3 install checkio_client`

`checkio --domain=py config --key=`

Sync solutions into your local folder

`checkio sync`

(in beta testing) Launch local server so your browser can use it and sync solution between local file end extension on the fly. (doesn't work for safari)

`checkio serv -d`

Alternatevly, you can install Chrome extension or FF addon

`checkio install-plugin`
`checkio install-plugin --ff`
`checkio install-plugin --chromium`

Read more here about other functionality that the checkio client provides. Feel free to submit an issue in case of any difficulties.

Pair Programming (Beta-version)

Welcome to Pair Programming! Engage in real-time collaboration on coding projects by starting a session and sharing the provided unique URL with friends or colleagues. This feature is perfect for joint project development, debugging, or learning new skills together. Simply click 'Start Session' to begin your collaborative coding journey!

Waiting for Pair Programming to start...

You are trying to join a pair programming session that has not started yet.

Please wait for the session creator to join.

Waiting for Pair Programming to reconnect...

It looks like the creator of the pair programming session closed the editor window.

It might happen accidentally, so that you can wait for reconnection.