bzoj 1622: [Usaco2008 Open]Word Power The energy of the name [simulation]

You can simulate it. Note that the inclusion can be discontinuous.
For convenience, it is all converted to lowercase when reading it.

#include<iostream>
#include<cstdio>
using namespace std;
const int N=1005;
int n,m,s1,s2,ans[N];
struct qwe
{
    int len;
    char s[N];
}c[N],p[N];
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%s",c[i].s);
        while(c[i].s[c[i].len])
        {
            if(c[i].s[c[i].len]<'a')
                c[i].s[c[i].len]=c[i].s[c[i].len]+32;
            c[i].len++;
        }
    }
    for(int i=1;i<=m;i++)
    {
        scanf("%s",p[i].s);
        while(p[i].s[p[i].len])
        {
            if(p[i].s[p[i].len]<'a')
                p[i].s[p[i].len]=p[i].s[p[i].len]+32;
            p[i].len++;
        }
    }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        {
            s1=0,s2=0;
            while(s1<c[i].len&&s2<p[j].len)
            {
                if(c[i].s[s1]==p[j].s[s2])
                    s2++;
                s1++;
            }
            if(s2==p[j].len)
                ans[i]++;
        }
    for(int i=1;i<=n;i++)
        printf("%d\n",ans[i]);
    return 0;
}