ACM_HDU 1020 Encoding

Encoding

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

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

2ABCABBCCC

 

Sample Output

ABCA2B3C

 

Author

ZHANG Zheng

 

Recommend

JGShining


思路：
别看错题。并注意，等于一的时候不输出一。

代码如下：

#include <iostream>  #include <cstdio>  #include <cstring>  char str[100000]; using namespace std;    int main()  {      int n,i,cnt;       cin >> n;      while(n--)      {          cin >> str;          for(i = 0; str[i]!='\0';i++)          {              cnt = 1;              while(str[i] == str[i+1])              {                  cnt++;                  i++;              }              if(cnt == 1)              cout << str[i] << endl;              else              cout << cnt << str[i] << endl;            }        }        return 0;  }