点击打开链接
-
输入
- The first line consist only one integer N, indicates N cases follows. In each case, there are two lines, the first line gives the string A, length (A) <= 10, and the second line gives the string B, length (B) <= 1000. And it is guaranteed that B is always longer than A. 输出
- For each case, output a single line consist a single integer, tells how many times do B appears as a substring of A. 样例输入
-
3 11 1001110110 101 110010010010001 1010 110100010101011
样例输出
-
3 0 3
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int main()
{int n,a,b,s,w,k,e;char s1[20],s2[1009];cin>>n;getchar();while(n--){ gets(s1);a=strlen(s1);gets(s2);b=strlen(s2);w=0,e=0;for(int i=0;i<=b-a;i++){ s=0;if(s2[i]==s1[0]&&a!=1){ k=i;for(int j=1;j<a;j++){if(s2[++k]==s1[j])s+=1;} if(s==(a-1))w=w+1;}if(s2[i]==s1[0]&&a==1){w++;}}cout<<w<<endl;}return 0;
}
解题思路：从B字符串的第一个字符开始检测，如果与A字符串中第一个字符相等，继续检测下面字符是否与A字符串相等。