AC自动机板子

/**************************
Au: Hany01
Date: Jan 4th, 2018
Prob: Aho-Corasick-Automaton
Email: hany01@foxmail.com
**************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define fir first
#define sec second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Ha (1000000007)

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

inline void File()
{
#ifdef hany01
    freopen("aho_corasick.in", "r", stdin);
    freopen("aho_corasick.out", "w", stdout);
#endif
}

const int maxn = 153, maxnode = 150 * 70 + 3, maxp = 73, maxs = 1000005;

int n;
char p[maxn][maxp], s[maxs];

#define idx(x) ((x) - 97)
struct Aho_Corasick_Automaton {

    struct Node {
        int nex[26], flag, fail;
        char ch;
    }tr[maxnode];

    int cnt, Ans[maxn];

    inline void Init() { Set(Ans, 0); cnt = 0; Set(tr, 0); }

    inline void Insert(char *s, int co) {
        register int u = 0;
        rep(i, strlen(s)) {
            if (!tr[u].nex[idx(s[i])]) u = tr[u].nex[idx(s[i])] = ++ cnt;
            else u = tr[u].nex[idx(s[i])];
            tr[u].ch = s[i];
        }
        tr[u].flag = co;
    }

    inline void Build_Fail() {
        static int u, v;
        static queue<int> q;
        rep(i, 26) if (u = tr[0].nex[i]) q.push(u);
        while (!q.empty()) {
            u = q.front(); q.pop();
            rep(i, 26)
                if (tr[u].nex[i]) {
                    q.push(tr[u].nex[i]); v = tr[u].fail;
                    while (v != 0 && !tr[v].nex[i]) v = tr[v].fail;
                    tr[tr[u].nex[i]].fail = tr[v].nex[i];
                } else tr[u].nex[i] = tr[tr[u].fail].nex[i];
        }
    }

    inline void Pos(char *s) {
        register int j = 0, k;
        rep(i, strlen(s))
            for (j = k = tr[j].nex[idx(s[i])]; k; k = tr[k].fail)
                ++ Ans[tr[k].flag];
    }

    inline void Print() {
        register int Max = 0;
        For(i, 1, n) chkmax(Max, Ans[i]);
        printf("%d\n", Max);
        For(i, 1, n) if (Max == Ans[i]) puts(p[i]);
    }

    inline void Debug() { For(i, 1, cnt) printf("%c %d %d\n", tr[i].ch, tr[i].flag, tr[i].fail); }

}AC;

inline void Solve()
{
    AC.Init();
    For(i, 1, n) scanf("%s", p[i]), AC.Insert(p[i], i);
    AC.Build_Fail();
    scanf("%s", s);
    AC.Pos(s);
    AC.Print();
}

int main()
{
    File();
    while (scanf("%d", &n) && n) Solve();
    return 0;
}
//夜来幽梦忽还乡。小轩窗。正梳妆。相顾无言，惟有泪千行。
//    -- 苏轼《江城子·乙卯正月二十日夜记梦》