HDOJ-1020 Encoding[水题]

Encoding

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

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

 

 

Author

ZHANG Zheng

 

 

Recommend

JGShining

 

 

 

第一次提交WA了，后来搜了一下解题报告，这题没有要求按字典序排列。

code:

#include<iostream>
#include<string>
using namespace std;
int main()
{
    int n;
    int sum; 
    int i;
    char str[10002];
    while(~scanf("%d",&n))
    {
        while(n--)
        {
            sum=0;
            scanf("%s",&str);
            for(i=0;i<strlen(str);i++)
            {
                sum++;
                if(str[i]!=str[i+1])
                {
                    if(sum==1)
                         printf("%c",str[i]);
                    else
                        printf("%d%c",sum,str[i]);
                    sum=0;
                }
            } 
            printf("\n"); 
        }
    }
    return 0;
}