Submission #371299

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;


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

  string ret = "";
  while(true){
    string tmp = "";
    while(true){
      string::size_type idx = str.find("not not ");
      if(idx == string::npos){
        tmp += str;
        break;
      }else{
        if(idx+10<str.length()){
          if(str.substr(idx+8, 3) == "not"){
            tmp += str.substr(0,idx+4);
            str = str.substr(idx+4);
          }else{
            tmp += str.substr(0,idx);
            str = str.substr(idx+8);
          }
        }else{
          tmp += str;
          break;
        }
      }
    }
    if(ret == tmp) break;
    ret = tmp;
    str = tmp;
  }

  cout << ret << endl;
  return 0;
}

Submission Info

Judge Result