cod

We can use an algorithm that identifies repeating subsequences in a text in order to encode the text. The basic idea of the algorithm is to replace a subsequence of the text with a reference in the form of &startPos-endPos, meaning that the subsequence being replaced is identical with the subsequence from the initial text that starts from position startPos and ends with position endPos. Warning! the specified positions refer to the original text, not to the encoded text.
E.g. text ABCDEFG ABCDEFG can be coded as &8-14 ABCDEFG.
Positions in the initial row are numbered starting with 0.

Task

Input file cod.in contains a single line with a sequence of characters, representing the encoded text.

Output file cod.out will contain a single line with the original text whose encoding is in the input file.

• The original (non-coded) text contains no more than 256 characters, all English alphabet letters and spaces.
• The encoded text contains between 1 and 50 characters.
• The encoded text contains English alphabet letters ('A'-'Z', 'a'-'z'), spaces (' ') and sequences like &x-y, where x and y are positive integers between 0 and 255 (inclusive), written without insignificant zeroes, and x<=y.
• We guarantee that the initial text can always be determined for all input data.

cod.in	cod.out	cod.in	cod.out
ABCDEFG &0-6	ABCDEFG ABCDEFG	ABA&13-14CC&10-11&17-18ACC&13-14AC&0-1	ABACCCCAACAACCCCACAB

prof. Popescu Carmen
"Gheorghe Lazar" Sibiu National High School
carmen_cngl@yahoo.com