Software Bugs 线性表-用数组模拟栈

escription

The biggest problem for all software developers are bugs. You definitely know the situation when a user calls to say ”I’ve found a bug in your program”. Once you have found and removed the bug, another one appears immediately. It is a hard and never-ending process.

Recently, there appeared a promising open-source initiative called “bug-preprocessor”. The bugpreprocessor is a program able to find all bugs in your source code and mark them, so they are relatively easy to be removed. Your task is to write a program that will remove all marked bugs from the preprocessed source code.

Input

The input contains a text representing the preprocessed source code, an unspecified number of lines of text, some of them may be empty. Bugs are represented by a case-sensitive string “BUG”. The text is terminated by the end of file. No line in the input will be longer than 100 characters.

Output

Your program must remove all of the bugs from the input and print a text that does not contain any BUG strings. Nothing else than bugs may be removed, not even spaces.

Sample Input
print "No bugs here..."
void hello() {
BUGBUG
printfBUG("Hello, world!\n");
}
wriBUGBUGtelBUGn("Hello B-U-G");
Sample Output
print "No bugs here..."
void hello() {
printf("Hello, world!\n");
}
writeln("Hello B-U-G");
 

#include<stdio.h>
char STACK[10000];int SP,i;
void push(char c)
{
	STACK[SP++]=c;
}
char pop()
{
	return STACK[--SP];
}

int main(void)
{
	char c;
	SP=0;
	while((c=getchar())!=EOF)
	if(c=='G'&&SP>1&&STACK[SP-2]=='B'&&STACK[SP-1]=='U')
	{
		pop();pop();
	}else push(c);
	for(i=0;i<SP;++i)
	print("%c",STACK[i]);
	return 0;
 } 

2019.7.22

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值