Submission #371143

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) begin(a),end(a)
#define MS(m,v) memset(m,v,sizeof(m))
#define D10  fixed<<setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
typedef long long ll;
const ll INF = 114514810;
const int MOD = 1000000007;
const double EPS = 1e-8;
const double PI = acos(-1.0);
struct edge
{
	int from, to, cost;
	bool operator < (const edge& e) const { return cost < e.cost; }
	bool operator >(const edge& e) const { return cost > e.cost; }
};
int dx[] = { -1, 0, 0, 1 }; int dy[] = { 0, -1, 1, 0 };
///*************************************************************************************///
///*************************************************************************************///
///*************************************************************************************///

int main()
{
	vs v;
	string s;
	while (cin >> s)
	{
		v.push_back(s);
	}
	while (v.back() != "not" && v.size()>2)
	{
		if (v[0] == "not"&&v[1] == "not")
		{
			v.erase(v.begin());
			v.erase(v.begin());
		}
	}
	REP(i, v.size())
	{
		cout << v[i] << (i == v.size() - 1 ? "\n" : " ");
	}
	return 0;
}

Submission Info

Judge Result