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

 

分析：从头扫一遍字符串，统计每个连续的字母序列有多少个，然后边统计边输出。

#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include <map>
#include <stack>
using namespace std;
#define INF 100000
typedef long long ll;
const int maxn=10010;
char s[maxn];
int main()
{
    int n;
    scanf("%d",&n);
    while(n--){
        scanf("%s",s);
        int temp=1;
        for(int i=1;i<=strlen(s);i++){
            if(s[i]==s[i-1]) temp++;
            else{
                if(temp==1) printf("%c",s[i-1]);
                else printf("%d%c",temp,s[i-1]);
                temp=1;
            }
        }
        printf("
");
    }
    return 0;
}