HDU 1020 Encoding

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
  
  

 

题意：

输入一个字符串，然后把连在一起并且相同的都统计到一起，输出格式为KX，K是X这个字母有几个期中1个的时候则忽略。

代码：

#include<stdio.h>
#include<string.h>
int main()
{
    int n,i,t,len;
    char str[10000];
    scanf("%d%*c",&n);
    while(n--)
    {
        t=0;
        gets(str);
        len=strlen(str);
        for(i=0;i<len;i++)
        {
            if(str[i+1]==str[i])
            {
                t++;
            }
            else
            {
                if(t==0)
                printf("%c",str[i]);
                else
                printf("%d%c",t+1,str[i]);
                t=0;
            }
        }
        printf("\n");

    }
    return 0;
}

 

分析：只要注意一下在字母的数量是1个的时候不输出就行了