With this technique the string can be compressed and represented by 4AB5C4D . The compressed string is of length 7 . Write a program which takes a string in compressed form and recreates the original uncompressed string. Input Input will be a series of lines with one string per line. There will be only uppercase letters and digits in the string.
All digits are compression counts.
There will never be two digits in a row. No input line will be longer than 50 characters. Output You are to output one line for each line of input. The output should be the uncompressed version of the input line. Index Page , Novice Problem Set , or Veteran Problem Set .