Encoding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18464 Accepted Submission(s): 7947
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.
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<stdio.h>
#include<string.h>
int main()
{
char a[10010],c;
int i,j,n,length,num;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a);
length=strlen(a);
num=1;
c=a[0];
for(j=1;j<=length;j++)
{
if(a[j]==c)
{
num++;
}
else
{
if(num==1)
{
printf("%c",c);
c=a[j];
}
else
{
printf("%d%c",num,c);
c=a[j];
num=1;
}
}
}
printf("\n");
}
return 0;
}