water- Encoding

 

Encoding

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

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

 

**********************************************************************************************************

简单题，统计字母的个数。

#include <iostream>
#include <cstdio>
#include <cstring>
char str[10005];
using namespace std;
int main()
{
    int n,cnt,len;
    char c;
    scanf("%d",&n);
    getchar();
    while(n--)
    {
        cnt=1;
        fgets(str,sizeof(str),stdin);
        c=str[0];
        len=strlen(str);
        for(int i=1;i<=len;i++)
        {
            if(c==str[i])
                cnt++;
            else
            {
                if(cnt==1)
                    printf("%c",str[i-1]);
                else
                    printf("%d%c",cnt,str[i-1]);
                c=str[i];
                cnt=1;
            }
        }
    }
    return 0;
}