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

 

水题之一，就是给你n串字符，按顺序输出字母连续出现的次数。

表示一开始将数字和字母位置弄反了，导致一直WA的我真是无药可救了。

代码如下：

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
char ch[15000],before;
int num,n;
int main(){
    scanf("%d",&n);
    while(n!=0)
    {
        n--;
        scanf("%s",ch);
        int len=strlen(ch);
        before=ch[0];
        num=1;
        for (int i=1;i<len;++i)
        {
            if (ch[i]==before)
            num++;
            else
            {
                if (num!=1)
                printf("%d%c",num,before);
                else
                printf("%c",before);
                num=1;
                before=ch[i];
            }
            
        }if (num!=1)
                printf("%d%c\n",num,before);
                else
                printf("%c\n",before);
        
    }
    return 0;
}