[백준 9935번]문자열 폭발

소스코드

---

#include <iostream>
using namespace std;
 
char word[1000001],fire[37],st[1000001];
int word_length = 0, fire_length = 0,sp=0;
 
void search() {
    for (int i = 0; i < word_length;i++) {
        st[sp++] = word[i];
        if (word[i] == fire[fire_length-1]) {
            int cnt=0;
            for (int j = sp-1,k=fire_length-1; j >= sp - fire_length, k>=0; j--,k--) {
                if (st[j] == fire[k]) cnt++;
            }
            if (cnt == fire_length)
                sp -= (fire_length);
        }
    }
}
 
int main() {
    ios::sync_with_stdio(false);
    cin >> word;
    cin >> fire;
    while (word[word_length++] != NULL);
    while (fire[fire_length++] != NULL);
    word_length -= 1;
    fire_length -= 1;
    search();
    if (sp==0){
        cout << "FRULA";
        return 0;
    }
    for (int i = 0; i < sp; i++) {
        cout << st[i];
    }
    return 0;
}