hdu 1020 简单的字符串处理

题目来源：http://acm.hdu.edu.cn/showproblem.php?pid=1020

Encoding

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 23937    Accepted Submission(s): 10515

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<stdio.h>
#include<string>
#include<string.h>
#include<map>
#include<math.h>
#include<algorithm>
#define N 10005
using namespace std;
char str[N];
int main()
{
    int n,i,t;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%s",str);
        i=0;
        while(str[i]!='')
        {
            t=i;
            while(str[t+1] == str[t])
                t++;
            if(t>i)
                printf("%d%c",t-i+1,str[t]);
            else
                printf("%c",str[t]);
            i=t+1;
        }
        printf("
");
    }
    return 0 ;
}