内存:64  时间:1

题目描述

Given a string containing only ‘A’ – ‘Z’, we could encode it using the following method: 1. Each sub-string containing k same characters should be encoded to "kX" where "X" is the only character in this sub-string. 2. If the length of the sub-string is 1, ‘1’ should be ignored.

输入

The first line contains an integer N (1 <= N <= 100) which indicates the number of test cases. The next N lines contain N strings. Each string consists of only ‘A’ – ‘Z’ and the length is less than 10000.

输出

For each test case, output the encoded string in a line.

样例输入

2
ABC
ABBCCC

样例输出

ABC
A2B3C

提示

杭电1020

代码如下

#include <iostream>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
using namespace std;
int main()
{
    int n,i,j,c,m;
    char a[10010],b[10];
    cin>>n;
    gets(b);
    for(i=0;i<n;i++)
    {

        memset(a,'\0',sizeof(a));
        gets(a);
        m=strlen(a);
        for(c=1,j=1;j<=m;j++)
        {
            if(a[j]==a[j-1])
            {
                c++;
            }
            else
            {
                if(c>1)
                {
                    cout<<c<<a[j-1];
                }
                else
                {
                    cout<<a[j-1];
                }
                c=1;
            }
        }
        cout<<endl;
    }
    return 0;
}

代码来源于互联网,仅供参考!