ACM程序设计题目 Problem Y-25

//输入n个数，查找这个数中相邻相同数字的个数，并输出个数和这个数。例如122344111   则输出1122132431

//把这个数字按字符串处理，定义一个初始值为1的变量存储个数，从a到a+a.size（）寻找，相同则+1，不同直接输出当前个数和当前数字，注意到n-1位是要特别说明，否则最后一位可能不会输出。

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

        string的求长度函数。

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