hdu 1020 Encoding

Encoding

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 33473    Accepted Submission(s): 14895

Problem Description

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.

 

Input

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.

 

Output

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

 

Sample Input

2

ABC

ABBCCC

 

Sample Output

ABC

A2B3C

 

Author

ZHANG Zheng

 

Recommend

JGShining   |   We have carefully selected several similar problems for you:  1062 1032 1039 1073 1161 

 

很水的题，题意看输入输出就应该能懂。

 

题意：统计一个连续出现的字符个数。

 

附上代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
    int n,i,t,s;
    char a[10010];
    scanf("%d",&n);
    while(n--)
    {
        scanf("%s",a);
        s=strlen(a);
        t=1;
        for(i=1; i<=s; i++)
        {
            if(a[i-1]==a[i])
                t++;
            else
            {
                if(t>1)
                    printf("%d%c",t,a[i-1]);
                else
                    printf("%c",a[i-1]);
                t=1;
            }
        }
        printf("
");
    }
    return 0;
}