hdu(1020)Encoding统计字符

Encoding

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 39808    Accepted Submission(s): 17625


[align=left]Problem Description[/align]
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.

 

[align=left]Input[/align]
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.

 

[align=left]Output[/align]
For each test case, output the encoded string in a line.

 

[align=left]Sample Input[/align]

2
ABC
ABBCCC

#include<stdio.h>
int main()
{
int i,c,t;
char s[10001];
scanf("%d",&t);
getchar();
while(t--)
{
gets(s);
for(i=0;s[i];i++)
{
c=1;
while(s[i]==s[i+1])
c++,i++;
if(c!=1)printf("%d%c",c,s[i]);
else printf("%c",s[i]);
}
puts("");
}
return 0;
}

 

[align=left]Sample Output[/align]

ABC
A2B3C