hdoj1020



/*Encoding

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 0   Accepted Submission(s) : 0

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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*/

<span style="font-size:18px;">#include <stdio.h>
#include <string.h>
int main()
{
 int i,j,k,len,n;
 char s[10000];
 scanf("%d",&n);
 while(n--)
 {
  scanf("%s",s);
  len = strlen(s);
  k = 1;
  for(i=0,j=i+1;i<len;)
  {
   while(j<len)
   {
    if(s[j]==s[i]) 
    {
     k++;
     j++;
    }else break;
   }
   if(k>1)
   {
    printf("%d%c",k,s[i]);
    i = j;
    j = i+1;
    k = 1;
   }else 
   {
    printf("%c",s[i]);
    i++;
    j = i+1;
   }
  }
  printf("\n");
 }
 return 0;
}</span>