ACM训练

A - AAAAA

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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 <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
using namespace std;
char s[10010];
int main()
{
    int t,n,i,j,k;

    while(cin>>t)
    {
        while(t--)
        {
            k=1;
            cin>>s;
            n=strlen(s);
            for(i=0;i<n;i++)
            {
                if(s[i]==s[i+1])
                {
                    k++;
                }
                else
                {
                    if(k==1)
                        cout<<s[i];
                    else
                        cout<<k<<s[i];
                    k=1;
                }
            }

           cout<<endl;
        }
    }
    return 0;
}