| UT Open 2025 |
|---|
| Finished |
The UTPC officers have planned an exciting transcontinental road trip across the United States! They begin their journey in the vibrant city of San Francisco.
While in Fisherman's Wharf, Aaryan stumbled upon a fishy tank. He wants to remember this moment vividly, but because the UTPC officers forgot to bring a camera, he can't take a picture. He has thus come to you to ask for a drawing of the fishy tank.
The fishy tank has $$$n$$$ fishies. An empty tank can be displayed by a $$$15$$$ by $$$25$$$ grid of '-', 'o', '|', and space characters, as shown in the sample test cases.
Aaryan wants you to draw the fish tank with $$$n$$$ fishies in it. Each fishy is represented by the sequence of characters '><>' (facing right) or the sequence '<><' (facing left). The fishies can appear anywhere as long as each fishy doesn't overlap with any other fishy or the border of the grid. There is no restriction on which direction the fishies must be facing. Aaryan will be happy if the drawing consists of exactly $$$n$$$ fishies. Please make Aaryan happy!
The input will consist of a single integer $$$n$$$ ($$$1 \leq n \leq 10$$$) — the number of fishies in the tank.
Output $$$15$$$ lines, each containing a string of length $$$25$$$, representing the drawing that you have made for Aaryan.
2
o-----------------------o | | | | | | | <>< | | | | ><> | | | | | | | | | | | | | | | o-----------------------o
5
o-----------------------o | | | <>< | | | | | | ><> ><> | | | | ><> | | | | | | | | | | | | ><> | o-----------------------o
| Name |
|---|


