《ACM程序设计》书中题目Y(几个几@v@~~)

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

这道题就是读取一串数字，连续的几个数字就用ab（连续的a个b）描述；

思路如下：

1.利用字符数组存数字；

2.输入后逐个检查，遇到数字变化便输出一次“ab”；

程序如下：

#include<bits/stdc++.h>
using namespace std;
int main()
{
        char num[1005],x;
        int i,j,n,t;
        cin>>n;
        for(i=0;i<n;i++)
        {
                t=0;
                memset(num,0,1004);       //一次输入输出完成后计数器和字符串归零
                cin>>num;
                x=num[0];
                for(j=0;j<=strlen(num);j++)
                {
                        if(x==num[j])       //相同数字计数器加一
                        {
                                t++;
                        }
                        else
                        {
                                cout<<t<<num[j-1];            //数字不同输出，计数器归一（因为这一次数字被判定掉了）
                                t=1;
                                x=num[j];
                        }
                }
                cout<<endl;
        }
}