Encoding

Encoding

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

 

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:  1008 1004 1002 1019 1021 

 英语学的不好，sub-string是连续字符的意思，

#include<iostream>
#include<string.h>
using namespace std;
int main()
{
    int n,i,j;
    string a;
    int b[27];
    scanf("%d",&n);
    while(n--)
    {
        memset(b,0,sizeof(b));
        cin>>a;
        j=0;
        for(i=0;i<a.size();i++)
        {
            j=1;
            while(a[i]==a[i+1])
            {
                j++;
                i++; 
            }
            if(j>1)
            printf("%d%c",j,a[i-1]);
            else
            printf("%c",a[i]) ;
        }
        
        cout<<endl;
    }
    return 0;
 }