LOOKSAY  Look and Say
The look and say sequence is defined as follows. Start with any string of digits as the first element in the sequence. Each subsequent element is defined from the previous one by "verbally" describing the previous element. For example, the string 122344111 can be described as "one 1, two 2's, one 3, two 4's, three 1's". Therefore, the element that comes after 122344111 in the sequence is 1122132431. Similarly, the string 101 comes after 1111111111. Notice that it is generally not possible to uniquely identify the previous element of a particular element. For example, a string of 112213243 1's also yields 1122132431 as the next element.
Input
The input consists of a number of cases. The first line gives the number of cases to follow. Each case consists of a line of up to 1000 digits.
Output
For each test case, print the string that follows the given string.
Example
Input: 3 122344111 1111111111 12345 Output: 1122132431 101 1112131415
hide comments
Prachi Sharma:
20111225 11:30:04
even after successful submission...why it is not included in solved problems???

Added by:  Nikola P Borisov 
Date:  20081001 
Time limit:  0.751s24.06s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ICPC North America Rocky Mountain Regional Contest 2007 