Submission #372472

---

Source Code Expand

#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;

int main() {
    vector<string> S;
    string str;
    while (cin >> str) {
        S.push_back(str);
    }
    while (true) {
        bool modified = false;
        for (size_t i = 0; i + 2 < S.size(); ++i) {
            if (S[i] == "not" && S[i + 1] == "not" && S[i + 2] != "not") {
                S.erase(S.begin() + i);
                S.erase(S.begin() + i);
                modified = true;
                break;
            }
        }
        if (!modified)
            break;
    }
    for (size_t i = 0; i < S.size(); ++i) {
        cout << S[i];
        if (i + 1 == S.size())
            cout << endl;
        else
            cout << ' ';
    }
    return 0;
}

Submission Info

Judge Result