Submit  All submissions  Best solutions  Back to list 
LOOK_SAY  Look and say (challenge) 
Wersja polska  English version 
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
Author of this problem is Nikola P Borisov.
Added by:  Piotr Kąkol 
Date:  20100425 
Time limit:  5.927s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS OBJC SCM qobi VB.NET 
Resource:  Copy of Nikola P Borisov's task LOOKSAY with different scoring 
hide comments
20131111 19:16:20 Piotr KÄ…kol
@jeffry copps  There are more than 100 tests. BTW, you don't need to read all the numbers into an array and then process them. You may process them just after reading: while(n)


20131106 21:17:45 jeffry copps
I dont know why its showing wrong answer for my code. It works perfectly. Can anyone help me ? 

20130913 21:38:10 Jander
Hmm. I think there are some missing tests. Submission #10039158 for an input of 1x100 . 2x5 . 3x6 I gets: 2015263 not 10015263 Like it should. Last edit: 20130914 05:26:13 

20130913 09:30:46 Jander
Had to do a sed one for a laugh. 