Encoding(1020)

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 <math.h>  
#include <stdlib.h>  
#include <ctype.h>  
int main()  
{    

   
   	char s[10001];

   
   	char a[10001];

   
   	int b[10001];

   
   	int l,i,j;

   
   	int count;

   
   	int n;

   
   	while(scanf("%d",&n)!=EOF)

   
   	{

   
   		while(n--)

   
   		{
   
   	

   
   			for(i=0;i<10001;i++)

   
   			b[i]=0; 

   
   			count=0;

   
   			scanf("%s",s);

   
   			l=strlen(s);

   
   			 

   
   			for(i=0;i<l;i++)

   
   			{

   
   				if(i==0)

   
   				{

   
   					a[count]=s[i];

   
   					b[count]++;

   
   				}

   
   				else if(s[i]==s[i-1])

   
   				{

   
   					b[count]++;
   
   	

   
   				}

   
   				else

   
   				{
   
   	count++;

   
   					a[count]=s[i];

   
   					b[count]++;

   
   				}

   
   			}

   
   			for(i=0;i<=count;i++)

   
   			{

   
   				if(b[i]==1)

   
   				printf("%c",a[i]);

   
   				else

   
   				printf("%d%c",b[i],a[i]);

   
   			} 

   
   			printf("\n");
   
   			

   
   		}

   
   	}
      
    return 0;  
}




   
   二。用的时间少。


#include <stdio.h> 
#include <string.h>  
#include <math.h>  
#include <stdlib.h>  
#include <ctype.h>  
int main()  
{    

   
   	char s[10001];
   
   	

   
   	int l,qi,mo;

   
   	int count;

   
   	int n;

   
   	while(scanf("%d",&n)!=EOF)

   
   	{

   
   		while(n--)

   
   		{
   
   	

   
   			count=0;

   
   			scanf("%s",s);

   
   			l=strlen(s);

   
   			 

   
   			for(qi=mo=0;qi<=l && mo<=l;)

   
   			{
   
   			

   
   				if(s[qi]==s[mo])

   
   				{

   
   					count++;

   
   					mo++;

   
   				}

   
   				else

   
   				{
   
   	if(count!=1)

   
   					printf("%d%c",count,s[qi]);

   
   					else

   
   					printf("%c",s[qi]);

   
   					count=0;

   
   					qi=mo;
   
   	

   
   				}

   
   				

   
   			}

   
   			printf("\n");
   
   						

   
   		}

   
   	}
      
    return 0;  
}