剪花布條
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8337 Accepted Submission(s): 5438
#include<stdio.h>
#include<string.h>
int main()
{
char str[1010],substr[1010];
while(scanf("%s",str)&&strcmp(str,"#")!=0)
{
scanf("%s",substr);
int len = strlen(str);
int sublen = strlen(substr);
if(len>=sublen)
{
int i,j;
int count = 0;
for(i=0;i<len;i++)
{
j=0;
while(str[i]==substr[j]&&j<sublen)
{
i++;
j++;
}
if(j==sublen)
{count++;i--;}
}
printf("%d\n",count);
}
else
{
printf("0\n");
}
}
return 0;
}
再粘一個:
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int main()
{
char str1[1010],str2[1010];
while(scanf("%s",str1)&&(strcmp("#",str1)!=0))
{
scanf("%s",str2);
int cur=0;
int count=0;
while(strstr(str1+cur,str2)!=NULL)
{
cur=strstr(str1+cur,str2)-str1+strlen(str2);
count++;
}
cout<<count<<endl;
}
return 0;
}