nyoj_5:Binary String Matching

简单字符串匹配

题目链接

#include<iostream>#include<cstring>using namespace std;int fun(char*aa,char*bb){    int i;    for(i=0;aa[i];i++)        if(aa[i]!=bb[i]) return 0;    return 1;}int main(){    int n,i,re,len_a,len_b;    char aa[12],bb[1002];    cin>>n;    while(n--)    {        cin>>aa;        cin>>bb;        re=0;        len_a=strlen(aa);        len_b=strlen(bb);        for(i=0;i<=len_b-len_a;i++)            if(fun(aa,&bb[i])) re++;        cout<<re<<endl;    }    return 0;}