Pagini recente » Cod sursa (job #2966912) | Cod sursa (job #2199331) | Cod sursa (job #1552248) | Cod sursa (job #3280932) | Cod sursa (job #552238)
Cod sursa(job #552238)
#include<iostream>
#include<fstream>
using namespace std;
unsigned long n,m,i,nr,nrt=0;
char a[2000001],b[2000001];
int main()
{
ifstream f("strmatch.in");
ofstream g("strmatch.out");
f>>a>>b;
n=strlen(a);
m=strlen(b);
//cout<<'\n'<<n<<'\n'<<m<<'\n';
nr=0;
if(m>=n)
{
for(i=0;i<=m-1;i++)
{
if(a[nr]==b[i])
{
if(nr==n-1)
{
nrt++;
nr=-1;i=i-n+1;
}
nr++;
}
else if(a[nr]!=b[i])
{
i-=nr;
nr=0;
}
}
g<<nrt<<'\n';
nr=0;
for(i=0;i<=m-1;i++)
{
if(a[nr]==b[i])
{
if(nr==n-1)
{
g<<i-n+1<<'\n';
nr=-1;i=i-n+1;
}
nr++;
}
else if(a[nr]!=b[i])
{
i-=nr;
nr=0;
}
}
}
else
{
for(i=0;i<=n-1;i++)
{
if(b[nr]==a[i])
{
if(nr==m-1)
{
nrt++;
nr=-1;i=i-m+1;
}
nr++;
}
else if(b[nr]!=a[i])
{
i-=nr;
nr=0;
}
}
g<<nrt<<'\n';
nr=0;
for(i=0;i<=n-1;i++)
{
if(b[nr]==a[i])
{
if(nr==m-1)
{
g<<i-m+1<<" ";
nr=-1;i=i-m+1;
}
nr++;
}
else if(b[nr]!=a[i])
{
i-=nr;
nr=0;
}
}
}
}