杭电1020Encoding

地址：http://acm.hdu.edu.cn/showproblem.php?pid=1020

题目：

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

 

直接扫描一遍就好，不用用数组储存数据；

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <queue>
#include <stack>
#include <map>
#include <vector>

#define PI acos((double)-1)
#define E exp(double(1))
using namespace std;

int main (void)
{
    int t,n;
    char a,b;
    cin>>t;
    scanf("%*c");
    while(t--)
    {
        n=1;
        scanf("%c",&a);
        while(scanf("%c",&b)==1 && b!='
')
        {
            if(a == b)
            {
                    n++;
            }
            else
            {
                if(n>1)
                    printf("%d%c",n,a);
                else
                    printf("%c",a);
                n=1;
                a=b;
            }
        }
        if(n>1)
                printf("%d%c
",n,a);
            else
                printf("%c
",a);
    }
    return 0;
}