1670.cpp

来自「这是哈尔滨工业大学acmOJ的源代码」· C++ 代码 · 共 67 行

/*  This Code is Submitted by wywcgs for Problem 1670 on 2005-10-30 at 01:31:21 */ 
#include <cstdio>

const int MAX = 512;

void printSeq(char*, int);

int main()
{
	char line[MAX], stack[MAX];
	int i;
	int n, top;
	
	while(gets(line) != NULL) {
		n = top = 0;
		for(i = 0; line[i] != 0; i++) {
			if(top == 0) {
				stack[top++] = line[i];
				n++;
			} else if(line[i] == stack[top-1]) {
				if(top == 1) {
					n++;
				} else {
					printSeq(stack, top-1);
					top = 0;
					stack[top++] = line[i];
					n = 2;
				}
				if(n == 9) {
					printf("9%c", stack[--top]);
					n = 0;
				}
			} else {
				if(top == 1 && n != 1) {
					printf("%d%c", n, stack[--top]);
					n = 0;
				}
				stack[top++] = line[i];
				n = 1;
			}
		}
		if(top == 1 && n != 1) {
			printf("%d%c", n, stack[--top]);
		} else {
			printSeq(stack, top);
		}
		putchar('\n');
	}
	
	return 0;
}

void printSeq(char *p, int n)
{
	int i;
	if(n > 0) {
		putchar('1');
		for(i = 0; i < n; i++) {
			putchar(p[i]);
			if(p[i] == '1') {
				putchar(p[i]);
			}
		}
		putchar('1');
	}
}