shift_and算法

int shift_and(unsigned char* str, unsigned char* target) {
    int len = strlen((const char*)target);
    unsigned int *D = (unsigned int*)calloc(256, sizeof(int));
    for (int i = 0; i < len; i++) {
        D[target[i]] |= (1 << i);
    }
    unsigned int P = 0;
    while (*str) {
           //类似于求KMP的next数组
        P = ((P << 1) | 1) & D[*str];
        if (((1 << (len - 1)) & P) != 0) return 1;
        str++;
    }
    return 0;
}
int main() {
    char buf[20];
    char target[20];
    while (scanf("%s %s", buf, target) != EOF) {
        printf("%d\n", shift_and((unsigned char*)buf, (unsigned char*)target));
    }
    return 0;
}