Your task is to build a bridge to connect two cliffs given an input d
, the distance apart. d
will always be even
However, the bridge needs columns to hold it up. Each column can hold a max of 6 spaces on each side.
For this example:
________ ________
| |
A | | B
|----------------------|
d = 22
The bridge for d = 20
should look like this with two columns. Columns do not count in d.
_____|__________|_____
12345|1234554321|12345
| |
Rules:
Must have enough columns to stand up.
Must have minimum number of columns needed to stand up.
Must be symmetrical
Lowest amount of Bytes Wins
Examples: (#s are only to help you count spaces. Should not be included in your output)
d = 10
_____|_____
12345|12345
|
d = 32
_____|___________|___________|_____
12345|12345654321| |
| | |
d = 8
____|____
1234|1234
|
d = 4
__|__
12|34
|
d = 22
_____|____________|_____
12345|123456654321|
| |
or
______|__________|______
123456|1234554321|123456
| |