Look and Say
|Time Limit: 5000MS||Memory Limit: 65536K|
|Total Submissions: 6516||Accepted: 3944|
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.
Rocky Mountain 2007
[sourcecode language="cpp" collapse="true" padlinenumbers="true"]
//Sun 31 Jan 2010 02:00:16 AM CST
using namespace std;
cin >> N;
for(int i=0; i<N; i++)
cin >> str;
int len = str.size();
char ch = str;
int count = 1;
for(int i=1; i<len; i++)
if(ch == str[i])
cout << count << (ch-'0');
ch = str[i];
count = 1;
cout << count << (ch - '0') << endl;