【HDU 5311 Hidden String】+ 字符串

Hidden String

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 1945 Accepted Submission(s): 721

Problem Description
Today is the 1st anniversary of BestCoder. Soda, the contest manager, gets a string s of length n. He wants to find three nonoverlapping substrings s[l1..r1], s[l2..r2], s[l3..r3] that:

1. 1≤l1≤r1

#include<cstdio>
#include<cstring>
using namespace std;
#define f(i,a,b) for(int i = a; i <= b; i++)
char s[110],x[22] = "anniversary",y[22];
int bc(){
    f(i,0,8) f(j,i + 1,9){
         strcpy(y,x),y[i + 1] = 0;
         int nl = strstr(s,y) - s; // 从字符串s中查找是否有字符串b， 如果有从s中的b位置起，返回s的指针，如果没有，返回null。
         if(nl < 0) continue; nl += i + 1;
         strcpy(y,x + i + 1),y[j - i] = 0;
         nl = strstr(s + nl,y) - s; if(nl < 0) continue; nl += j - i;
         strcpy(y,x + j + 1), y[10 - j] = 0, nl = strstr(s + nl,y) - s; if(nl < 0) continue;
         return 1;
    }
    return 0;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%s",s);
        if(bc()) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}