有趣的编码累加问题 Encoding 【水】

Encoding

Time Limit: 1 Sec   Memory Limit: 32 MB
Submit: 23   Solved: 8
[ Submit][ Status][ Web Board]

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

HINT

Source

#include <stdio.h>
#include <iostream>
using namespace std;
const int MAX = 10001;

int main()
{
	int n;
	int i,j;
	char x[MAX];
	char c;
	
	while(~scanf("%d",&n))
	{
		while ( n-- )
		{
			cin >> x;
			i = 0,  j = 1;
			while( x[i] != '\0')
			{
				if ( x[i] == x[ i + 1])
				{
					j++;
					i++;

				}
				else 
				{
					
					c = x[i];
					if ( j == 1)
					{
							cout << c;
							i++;
							 
					}
					
					else 
					{
					 
						cout << j;
						cout << c;
						i++;
						j = 1;
					} 
				}
				
			} 
			cout << endl;
			
			
		}
			
	
	}
		
		
		return 0;
}

这么水的题目 居然上传错了几次 什么鬼。。。。。