Pagini recente » Cod sursa (job #2103089) | Cod sursa (job #441432) | Cod sursa (job #345079) | Cod sursa (job #344531) | Cod sursa (job #570566)
Cod sursa(job #570566)
#include<string.h>
#include<fstream.h>
char s[2000002],a[2000002];
int p[2000000];
int d[1004];
int n,m;
int nr=0;
void calculprefix()
{
int k = 0;
p[1] = 0;
for(int i=2;i<=n;i++)
{
while(k > 0 && s[k + 1]!=s[i])
k = p[k];
if(s[k + 1] == s[i])
k = k + 1;
p[i] = k;
}
}
void kmp()
{
int k=0;
for(int i=1;i<=m && nr<=1000;i++)
{
while(k > 0 && s[k + 1]!=a[i])
k = p[k];
if(s[k + 1] == a[i])
k = k + 1;
if(k==n)
{ nr++;
d[nr]=i-n;
}
}
}
int main()
{
ifstream f("strmatch.in");
ofstream g("strmatch.out");
f.get(s+1,2000002);
f.get();
f.get(a+1,2000002);
n = strlen(s+1);
m = strlen(a+1);
calculprefix();
kmp();
g<<nr<<"\n";
for(int i=1;i<=nr;i++)
g<<d[i]<<" ";
return 0;
}