Binary String Matching 简单匹配
http://acm.nyist.net/JudgeOnline/problem.php?pid=5 Binary String Matching#include<cstdio>#include<cstring>using namespace std;int main(){ int test; scanf("%d",&test); while(test--) { char a[1001]; char b[1001]; scanf("%s%s",a,b); int a1=strlen(a); int a2=strlen(b); int sum=0; for(int i=0; i<a2; i++) { int flag=1; if(b[i]==a[0]) { for(int j=1; j<a1; j++) { if(b[i+j]!=a[j]) { flag=0; break; } if(flag==0) break; } if(flag==1) sum++; } } printf("%d\n",sum); } return 0;}