2327.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2327 on 2006-08-20 at 22:53:18 */ 
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int PM = 32768, VM = 256;
const int L = 128000;
const char LGC[] = "<>-+.[]";

int cl, bra[L], pnt[PM], pt;
char cmd[L], tmp[L];
bool legal[VM] = { false };

int main()
{
	int T;

	for(int i = 0; LGC[i] != 0; i++) legal[LGC[i]] = true;
	scanf("%d\n", &T);
	for(int t = 1; t <= T; t++) {
		int stack[L], top = 0;
		for(cl = 0; true; ) {
			gets(tmp); cmd[cl] = 0;
			if(!strcmp(tmp, "end")) break;
			for(int i = 0; tmp[i] != 0 && tmp[i] != '%'; i++) {
				if(!legal[tmp[i]]) continue;
				if(tmp[i] == '[') stack[top++] = cl;
				else if(tmp[i] == ']') { bra[stack[top-1]] = cl; bra[cl] = stack[--top]; }
				cmd[cl++] = tmp[i];
			}
		}
		printf("PROGRAM #%d:\n", t);
		if(top != 0) { printf("COMPILE ERROR\n"); continue; }
		memset(pnt, 0, sizeof(pnt));
		for(int i = pt = 0; i < cl; i++) {
			switch(cmd[i]) {
			case '>': pt = (pt+1)&(PM-1); break;
			case '<': pt = (pt-1)&(PM-1); break;
			case '+': pnt[pt] = (pnt[pt]+1)&(VM-1); break;
			case '-': pnt[pt] = (pnt[pt]-1)&(VM-1); break;
			case '.': putchar(pnt[pt]); break;
			case '[': if(pnt[pt] == 0) i = bra[i]; break;
			case ']': if(pnt[pt] != 0) i = bra[i]; break;
			}
		}
		putchar('\n');
	}
	
	return 0;
}