Submission #371138

---

Source Code Expand

#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define all(a) (a).begin(),(a).end()
#define INIT(a) memset((a),0,sizeof(a))
#define fs first
#define sc second
#define pb push_back
#define sz size() 
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<string> vs;

const static int INF = 1e8;
const static D EPS = 1e-8;

int main(){
  string tmp;
  vector<string> s;
  while(cin >> tmp){
    s.push_back(tmp);
  }

  for(int i=s.size()-1;i>=2;i--){
    if(s[i] != "not" && s[i-1] == "not" && s[i-2] == "not"){
      s.erase(s.begin()+i-2);
      s.erase(s.begin()+i-2);
      i--;
    }
  }

  for(int i=0;i<(int)s.size();i++){
    cout << s[i] << " \n"[i+1==(int)s.size()];
  }
}

Submission Info

Judge Result