Submission #6402983

---

Source Code Expand

#include<bits/stdc++.h>
#define N 10001
using namespace std;
string s[N],o="not";
int n;bool vis[N];
int main()
{
	while(cin>>s[++n]);
	int p;
	for(int i=n-2;i>=1;i--)
	{ 
		if(!vis[i+2])p=i+2;
		if(s[i]==o&&s[i+1]==o&&s[p]!=o)
			vis[i]=vis[i+1]=1,i--;
	}
	int t=n;
	while(vis[t])t--;
	for(int i=1;i<=n;i++)
		if(!vis[i])
		{
			cout<<s[i];
			if(i-t)putchar(' ');
			else puts("");
		}
	return 0;
}

Submission Info

Judge Result