HDU 4150 Powerful Incantation

搜索子串的个数，比较简单

#include<stdio.h>
#include<string.h>
#define MAX 1000001
char ch[MAX];
int main()
{
    int n,i,j,c,k;
    int len1,len2;
    int count;
    char dex[6];
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%s%s",ch,dex);
        len1=strlen(ch);
        len2=strlen(dex);
        count=0;
        for(j=0;j<=len1-len2;j++)
        {
            k=j;
            for(c=0;c<len2;c++)
            {
                if(dex[c]==ch[k]) k++;
                else break;
            }
            if(c==len2)
            {
                count++;
                j+=len2-1;
            }

        }
        printf("%d\n",count);
    }
    return 0;
}