HDOJ 1020 一次AC代码

/*****************************************************************************
Baichenjia 2013.8.25
HD1020 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 <iostream>
#include <string>
using namespace std;

int main()
{
     char str[10000];
     int n;
     int i,j;
    cin>>n;
while(n --)
{
char strtemp[10000];
memset(str,0,10000);
memset(strtemp,0,10000);
cin>>str;
for(i = 0,j = 1;;i ++)
{
strtemp[j] = str[i];
if((strtemp[j] == strtemp[j- 1]) || (strtemp[j - 1] == 0))
{
j ++;
}
else if((strtemp[j] != strtemp[j- 1]) || (i == strlen(str)))
{
if(j == 2)
cout<<strtemp[j - 1];
else
cout<<j - 1<<strtemp[j - 1];
if(i == strlen(str))
break;
i = i - 1;
j = 1;
memset(strtemp,0,10000);
}
else
{}
}
cout<<endl;
}
return 0;
}