###### 九度oj-1094-String Matching

Finding all occurrences of a pattern in a text is a problem that arises frequently in text-editing programs.
Typically,the text is a document being edited,and the pattern searched for is a particular word supplied by the user.
We assume that the text is an array T[1..n] of length n and that the pattern is an array P[1..m] of length m<=n.We further assume that the elements of P and  T are all alphabets(∑={a,b...,z}).The character arrays P and T are often called strings of characters.
We say that pattern P occurs with shift s in the text T if 0<=s<=n and T[s+1..s+m] = P[1..m](that is if T[s+j]=P[j],for 1<=j<=m).
If P occurs with shift s in T,then we call s a valid shift;otherwise,we calls a invalid shift.
Your task is to calculate the number of vald shifts for the given text T and p attern P.

For each case, there are two strings T and P on a line,separated by a single space.You may assume both the length of T and P will not exceed 10^6.

You should output a number on a separate line,which indicates the number of valid shifts for the given text T and pattern P.

abababab abab

3

2006年上海交通大学计算机研究生机试真题

#include<stdio.h>
#include<string.h>
char a[1000005],b[1000005];
int main()
{
int na,nb,i,j;
while(scanf("%s%s",a,b)!=EOF)
{
int count=0;
na=strlen(a);
nb=strlen(b);
for(i=0;i<=na-nb;i++)
{
for(j=0;j<nb;j++)
if(a[i+j]!=b[j])
break;
if(j==nb)
count++;
}
printf("%d\n",count);
}
return 0;
}


#### 九度内推 ACM 解题报告

2011年12月21日 39KB 下载

#### 九度求职经验系列之“实习生”篇.pdf

2014年06月02日 438KB 下载

#### 九度OJ的使用

2016-07-13 22:27:39

#### 【九度】题目1024：畅通工程

2013-12-06 14:03:07

#### 九度OJ 1138 进制转换

2016-08-05 16:45:22

#### 九度OJ-1436-Repair the Wall

2017-01-26 23:38:36

#### 【九度OJ】题目1194：八进制 解题报告

2017-03-06 20:38:53

#### 九度OJ 1070 今年的第几天？（模拟）

2014-12-15 00:02:08

#### 九度OJ 题目1138：进制转换

2015-08-26 18:30:49

#### 九度OJ-题目1019：简单计算器

2014-09-09 21:23:15