tjut 4300

来源：互联网发布：c 语言入门详解视频编辑：程序博客网时间：2024/06/11 11:20
#include <iostream>#include <cstdio>#include <cstring>using namespace std;int nxt[100005];char str[27];char s1[100005],s2[100005];void getnext(char *t){    int i = 0,j = -1;    nxt[0]=-1;    while(t[i])    {        if(j == -1 || t[i] == t[j])        {            i++;            j++;            nxt[i] = j;        }        else            j = nxt[j];    }}int kmp(char *s,char *t){    int i = 0,j = 0;    int slen =strlen(s),tlen = strlen(t);    getnext(t);    while(i<slen && j<tlen)    {        if(j == -1 || s[i] == t[j])        {            i++;            j++;            if(i == slen)                return j;        }        else            j = nxt[j];    }    return 0;}int main(){    int t;    cin >> t;    while(t--)    {        scanf("%s",str);        scanf("%s",s1);        int len = strlen(s1);        strcpy(s2,s1+(len+1)/2);        printf("%s",s1);        for(int i = 0; s1[i]; i++)        {            for(int j = 0; j<26; j++)            {                if(s1[i] == str[j])                {                    s1[i] = 'a'+j;                    break;                }            }        }        int flag = kmp(s2,s1);        for(int i = flag; i<len-flag; i++)        {            printf("%c",s1[i]);        }        cout << endl;    }        return 0;}
0 0