杭电oj1020

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

AC代码：

#include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
	int n;
	cin >> n;
	while (n--) {
		string str;
		cin >> str;
		int len = str.length();
		int cnt = 1;
		for (int i = 0; i < len; i++) {
			if (str[i + 1] == str[i]) {
				cnt++;
			}
			else {
				if (cnt > 1) {
					cout << cnt;
					cnt = 1;
				}
				cout << str[i];
			}
		}
		cout << endl;
	}
	return 0;
}