Submission #371286

---

Source Code Expand

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cstdio>
#include<map>
#include<set>
#include<queue>
#include<sstream>

using namespace std;

#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)
#define pb push_back
#define fi first
#define se second

typedef pair<int,int> pii;


int main(){
	
	vector<string> ans;
	string in;
	while(cin>>in){
		ans.pb(in);
	}
	
	while(1){
		bool hit = false;
		rep(i,ans.size()){
			if(ans.size()-i >= 3 && ans[i+0]=="not" && ans[i+1]=="not" && ans[i+2]!="not"){
				ans.erase(ans.begin()+i);
				ans.erase(ans.begin()+i);
				hit = true;
			}else{
				
			}
		}
		
		
		if(!hit)break;
	}
	
	rep(i,ans.size()){
		if(i!=0)printf(" ");
		cout<<ans[i];
	}cout<<endl;
}

Submission Info

Judge Result