Submission #3731242

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<list>
#include<set>
#include<cstring>
using namespace std;
long long int mod = 1e9 + 7;
template <class T>
void inputV(vector<T> &x, int n){
  for(int i=0; i<n; i++) cin >> x[i];
}

string func(string ss) {
  vector<string> s;
  string t = "";
  for(int i=0; i<ss.size(); i++){
    if(ss[i] == ' '){
      s.push_back(t);
      t = "";
    }else{
      t += ss[i];
    }
  }
  s.push_back(t);
  int n = s.size();
  s.push_back("not");
  s.push_back("not");
  vector<bool> a(n, true);
  for(int i=0; i<n; i++){
    if(s[i] == "not" && s[i+1] == "not" && s[i+2] == "not") continue;
    if(s[i] == "not" && s[i+1] == "not" && s[i+2] != "not"){
      a[i] = false;
      a[i+1] = false;
      i++;
    }
  }
  string ans = "";
  for(int i=0; i<n; i++){
    if(a[i]) ans += s[i] + ' ';
  }
  return ans.substr(0, ans.size()-1);
}

int main() {
  string ss; getline(cin, ss);

  while(true){
    string t = func(ss);
    if(t == ss) break;
    ss = t;
  }
  cout << ss << endl;

  return 0;
}




///

Submission Info

Judge Result