HDOJ 1020 Encoding

Encoding

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

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<stdio.h>
#include<string.h>
char str[10010];
int main()
{
	int n,i,len,count;
	scanf("%d",&n);
	while(n--)
	{
		scanf("%s",str);
		len=strlen(str);
		for(i=0;i<len;i++)
		{
			if(str[i]!=str[i+1])
			   printf("%c",str[i]);
			else
		    {   
		        count=1;
		    	for(;i<len;i++)
		    	{
		    		if(str[i]!=str[i+1])
		    		{
		    			printf("%d%c",count,str[i]);
		    			break;
		    		}
		    		count++;
		    	}
		    }
		}
		printf("\n");
	}
	return 0;
}