Pagini recente » Cod sursa (job #629907) | Cod sursa (job #1663883) | Cod sursa (job #1856305) | Cod sursa (job #2742667) | Cod sursa (job #3003506)
#include <fstream>
using namespace std;
ifstream cin("strmatch.in");
ofstream cout("strmatch.out");
#define MOD1 100007
#define MOD2 666013
#define PRIM 101
int match[2000005];
void rbk(string text,string sablon)
{
int na=text.size();
int nb=sablon.size();
int p1=1,p2=1;
int hashB1=0,hashB2=0;
for(int i=0; i<nb; i++)
{
hashB1=(hashB1*PRIM + sablon[i])%MOD1;
hashB2=(hashB2*PRIM + sablon[i])%MOD2;
if(i)
{
p1=(p1*PRIM)%MOD1;
p2=(p2*PRIM)%MOD2;
}
}
if(nb>na)
{
cout << 0;
return;
}
int hash1=0,hash2=0;
for(int i=0; i<nb; i++)
{
hash1=(hash1*PRIM+text[i])%MOD1;
hash2=(hash2*PRIM+text[i])%MOD2;
}
int cnt=0;
if(hash1 == hashB1 && hashB2 && hash2)
{
cnt++;
match[0]=1;
}
for(int i=nb; i<na; i++)
{
hash1=((hash1-(text[i-nb]*p1)%MOD1 + MOD1) * PRIM + text[i])%MOD1;
hash2=((hash2-(text[i-nb]*p2)%MOD2 + MOD2) * PRIM + text[i])%MOD2;
if(hash1 == hashB1 && hashB2 && hash2)
{
cnt++;
match[i-nb+1]=1;
}
}
cout << cnt << '\n';
cnt=0;
for(int i=0;i<na && i<1000;i++)
if(match[i])
cnt++,cout << i << ' ';
}
int main()
{
string a,b;
getline(cin,a);
getline(cin,b);
rbk(b,a);
return 0;
}