Y

Description

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.

Sample Input

3
122344111
1111111111
12345

Sample Output

1122132431
101
1112131415

题意：

输入字符串，看相邻的有多少相同的，输出该数的个数再输出该数，知道字符串结束

分析：

就是数数，相同就加1；不相同输出前一个相同的个数和前一个数

代码：

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,i,j,t;
    string s;
    while(cin>>n)
    {
        for(i=0;i<n;i++)
        {
            cin>>s;
            for(j=0,t=1;j<s.size()-1;j++)
            {
                if(s[j]==s[j+1])
                {
                    t++;
                }
                else
                    if(s[j]!=s[j+1])
                {
                    cout<<t;
                    cout<<s[j];
                    t=1;
                }
            }

            cout<<t<<s[j]<<endl;
        }
    }
}

感受：

就是在相同和不相同的不同处理那耽误了下，总体是挺简单