300656: CF125B. Simple XML
Memory Limit:256 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Simple XML
题意翻译
一个 $\texttt{XML}$ 表格由多个形如 $\texttt{<x>}$ 或者 $\texttt{</x>}$ 的操作组成,其中 $\texttt{x}$ 表示一个英文字母。 现在,给出一个长度为 $s$ 的 $\texttt{XML}$ 表格(**保证没有空格**),请你按照 $\texttt{XML}$ 表格的格式输出: - 前面应该有 $2\times h$ 的空格缩进,其中 $h$ 表示当前标签的级数。 - 每一个形如 $\texttt{<x>}$ 或者 $\texttt{</x>}$ 的操作。 翻译者提示:如果对题意不理解,可以考虑一下 $\texttt{C++}$ 中嵌套循环的格式。 **数据范围:$s\leqslant1000$。**题目描述
Let's define a string <x> as an opening tag, where $ x $ is any small letter of the Latin alphabet. Each opening tag matches a closing tag of the type </x>, where $ x $ is the same letter. Tegs can be nested into each other: in this case one opening and closing tag pair is located inside another pair. Let's define the notion of a XML-text: - an empty string is a XML-text - if $ s $ is a XML-text, then $ s' $ =<a>+ $ s $ +</a> also is a XML-text, where $ a $ is any small Latin letter - if $ s_{1} $ , $ s_{2} $ are XML-texts, then $ s_{1} $ + $ s_{2} $ also is a XML-text You are given a XML-text (it is guaranteed that the text is valid), your task is to print in the following form: - each tag (opening and closing) is located on a single line - print before the tag $ 2*h $ spaces, where $ h $ is the level of the tag's nestedness.输入输出格式
输入格式
The input data consists on the only non-empty string — the XML-text, its length does not exceed 1000 characters. It is guaranteed that the text is valid. The text contains no spaces.
输出格式
Print the given XML-text according to the above-given rules.
输入输出样例
输入样例 #1
<a><b><c></c></b></a>
输出样例 #1
<a>
<b>
<c>
</c>
</b>
</a>
输入样例 #2
<a><b></b><d><c></c></d></a>
输出样例 #2
<a>
<b>
</b>
<d>
<c>
</c>
</d>
</a>