SCU

Censor

frog is now a editor to censor so-called sensitive words (敏感词).

She has a long text pp. Her job is relatively simple -- just to find the first occurence of sensitive word ww and remove it.

frog repeats over and over again. Help her do the tedious work.

Input

The input consists of multiple tests. For each test:

The first line contains 11 string ww. The second line contains 11string pp.

(1≤length of w,p≤5⋅1061≤length of w,p≤5⋅106, w,pw,p consists of only lowercase letter)

Output

For each test, write 11 string which denotes the censored text.

Sample Input

    abc
    aaabcbc
    b
    bbb
    abc
    ab

Sample Output

    a
    
    ab


这题用KMP可以写 但是KMP不会

但是用HASH暴力一下，HASH暴力出奇迹

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
typedef unsigned long long ull;
const int maxn = 5e6 + 10;
const int seed = 13331;
ull HASH, s[maxn], p[maxn];
char a[maxn], b[maxn], ans[maxn];
void init() {
    p[0] = 1;
    for (int i = 1 ; i < maxn ; i++)
        p[i] = p[i - 1] * seed;
}
int main() {
    init();
    while(scanf("%s%s", a, b ) != EOF  ) {
        int lena = strlen(a), lenb = strlen(b);
        if (lena > lenb) {
            printf("%s
", b);
            continue;
        }
        HASH = 0;
        for (int i = 0 ; i < lena ; i++)
            HASH = HASH * seed + a[i];
        int top = 0;
        s[0] = 0;
        for (int i = 0 ; i < lenb ; i++) {
            ans[top++] = b[i];
            s[top] = s[top - 1] * seed + b[i];
            if ( top >= lena && s[top] - s[top - lena]*p[lena] == HASH ) top -= lena;
        }
        for (int i = 0 ; i < top ; i++)
            printf("%c", ans[i]);
        printf("
");
    }
    return 0;
}