54 人解决，68 人已尝试。
59 份提交通过，共有 179 份提交。
3.9 EMB 奖励。
单点时限: 5.0 sec
内存限制: 256 MB
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.
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.
For each test case, print the string that follows the given string.
3 122344111 1111111111 12345
1122132431 101 1112131415
54 人解决，68 人已尝试。
59 份提交通过，共有 179 份提交。
3.9 EMB 奖励。