zjnu 1744 EKSPLOZIJA(模拟栈)

EKSPLOZIJA

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 45		Accepted: 12

Description

Mirko likes to play with strings of characters, but this time he has taken it too far – he put an “explosion” in the string! An explosion is a series of characters which, if found in the vicinity of fire, explodes and starts a chain reaction. Mirko, being as negligent as he usually is, forgot that his string contained an explosion and placed it near a candlelight. Thus the chain reaction began. The chain reaction takes place in the following way:

• if a string contains explosions, they all explode and a new string is formed by concatenating the pieces without the exploding parts

• this concatenation could possibly create new explosions

• the chain reaction repeats while there are explosions in the string

Now Mirko wants to know whether anything will be left after this series of chain reactions. If nothing remains, output “FRULA” (without quotes). If, by any chance, something is left, output the final string remaining after all the reactions.

Please note: The explosion will not contain two equal characters.

Input

The first line of input contains Mirko's string, (1 ≤ |Mirko's string| ≤ 1 000 000). The second line of input contains the explosion string, (1 ≤ |explosion| ≤ 36). Both Mirko's string and the explosion string consist of uppercase and lowercase letters of the English alphabet and digits 0, 1, … 9.

Output

The first and only line of output must contain the final string remaining after all the reactions as stated in the task.

Sample Input

12ab112ab2ab 12ab

Sample Output

FRULA

Hint

Firstly, the bombs on positions 1 and 6 explode. Then we are left with ****1****2ab (where * marks the character that exploded) and when that string is put together, we get 12ab. Sadly, that is an explosion all over again so it disappears.

这题就是给你两个字符串，问你字符串一里面把所有字符串都删除还剩下什么

我就是模拟栈做得。。

AC代码：

/* ***********************************************
Author        :yzkAccepted
Created Time  :2016/3/19 20:57:06
TASK          :。.cpp
LANG          :C++
************************************************ */#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <stack>
using namespace std;
typedef __int64 ll;
const int maxn=1000010;
char st[maxn],s[maxn],g[maxn];
char ans[maxn];
int main()
{int i,j,k;//freopen("in.txt","r",stdin);//freopen("out.txt","w",stdout);memset(s,0,sizeof(s));memset(st,0,sizeof(st));memset(g,0,sizeof(g));memset(ans,0,sizeof(ans));scanf("%s",s+1);int n=strlen(s+1);scanf("%s",g+1);int m=strlen(g+1);int rear=0;int flag=1;for(i=1;i<=n;i++){st[++rear]=s[i];if(rear>=m && st[rear]==g[m]){flag=1;for(j=1;j<=m;j++){if(st[rear-m+j]!=g[j]){flag=0;break;}}if(flag==1)rear-=m;}}for(i=1;i<=rear;i++)ans[i]=st[i];if(rear==0)printf("FRULA\n");elseprintf("%s\n",ans+1);return 0;
}

zjnu 1744 EKSPLOZIJA(模拟栈)相关推荐

六、使用数组模拟栈的思路及代码实现
使用数组模拟栈的实现过程 1.栈的介绍 (1) 栈的英文为(stack) (2) 栈是一个先入后出(FILO-First In Last Out)的有序列表. (3) 栈(stack)是限制线性表中元 ...
第一回写的用arraylist模拟栈操作
package hashMap; import java.util.ArrayList; import d.Student; /*** 用ArrayList模拟栈操作* @author zhujiab ...
032_使用ArrayDeque模拟栈结构
import java.util.ArrayDeque; import java.util.Iterator;/*** 使用ArrayDeque模拟栈结构*/ public class DequeSt ...
数组模拟栈和队列板子
使用数组模拟数据结构栈和队列栈:后进先出对于栈:我们使用tt表示栈顶的下标,如果tt==0表示栈空队列:先进先出对于队列,我们使用hh表示队首,tt表示队尾,tt初始化为-1,判断队列是否为空 ...
Leetcode402 remove-k-digits贪心+vector模拟栈的思想
题目给定一个以字符串表示的非负整数 num,移除这个数中的 k 位数字,使得剩下的数字最小. 注意: num 的长度小于 10002 且 ≥ k. num 不会包含任何前导零. 示例 1 : 输入: ...
CCF-CSP 201903-2 二十四点 Python语言模拟栈实现
项目场景: 二十四点问题本质是处理表达式,一提到处理表达式第一反应大概就是使用栈来处理,虽然网上大部分使用python语言处理二十四点问题都是利用强大的eval()函数,但我仍然想要使用python的 ...
LinkedList 模拟栈和队列
LinkedList 比ArrayList 提供了更多的方法,其中有两个方法可以实现栈和队列的操作. removeFirst() 移除并返回此列表中的第一个元素. removeLast() 移除并返回 ...
Train Problem I（模拟栈）
题意:模拟栈,试问使用2个栈,能否使得串1变为串2 思路:模拟,经典问题,注意只要相同的元素放到栈顶后就不会再移动了,只需要考虑剩下的元素,因此每次只考虑一个元素的进入方式. #include< ...
eval？python顺序列表模拟栈实现计算器
python顺序列表模拟栈实现计算器借助list中的append和pop模拟顺序栈的入栈和出栈 instack = {'+':1,'-':1,'*':3,'/':3,'%':3,'(':6,')': ...

zjnu 1744 EKSPLOZIJA(模拟栈)

zjnu 1744 EKSPLOZIJA(模拟栈)相关推荐

最新文章

热门文章