Function query

String Algorithms/Finding Patterns.cpp:50–58

}

bool query(){
    int u = 0;
    for(int i = 0; i < M; i++){
        char c = T[i];
        if(!node[u].nxt.count(c))   return false;
        else                        u = node[u].nxt[c];
    }
    return true;
}

int main(){
    scanf(" %s %d", S, &K);