KMP

#include <iostream>

using namespace std;

#include <string>

  

const int Length = 20;

  

void get_next(stringSubString, int * next){

    int i = 1,j = 0;

    next[1] =0;

    while(i< SubString.length()){

        if(0== j || SubString[i-1] == SubString[j-1]){

            ++i;

            ++j;

            next[i]= j;

        }

        else

            j= next[j];

    }

}   //get_next

  

int Index_KMP(stringMainString, string SubString, int *next){

    int i = 0, j = 1;

    while(i<= MainString.length() && j <= SubString.length()){

        if(0== j || MainString[i-1] == SubString[j-1]){

            ++i;

            ++j;

        }

        else

            j= next[j];

    }

    if(j >SubString.length())

        return i - SubString.length();

    else

    return -1;

}

  

int main()

{

    int i, j, n;

    int next[Length];

    stringSubString, MainString;

  

    //freopen("cin.txt","r", stdin);

  

    cin>>n;

    for(i =0; i < n; i++){

        cin>>SubString>>MainString;

        get_next(SubString,next);

        for(j= 1; j < SubString.length(); j++)

            cout<<next[j]<<"";

        cout<<next[j]<<endl;

        cout<<Index_KMP(MainString,SubString, next)<<endl;

    }

    return 0;

}