Pagini recente » Cod sursa (job #2387094) | Cod sursa (job #2319574) | Cod sursa (job #2878896) | Cod sursa (job #638974) | Cod sursa (job #2387399)
#include <bits/stdc++.h>
#define mod 698365723
#define mod2 530957673
#define p 21564321
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
char a[2000005],b[2000005];
long long nr1,nr2,cs1,cs2;
vector <int> sol;
int main()
{
in >> a;
in >> b;
long long pr=1,p2=1;
int sta=strlen(a);
int stb=strlen(b);
if(sta>stb)
{
out << "0\n";
return 0;
}
for(int i=0; i<sta; i++)
{
nr1=(nr1*p+a[i])%mod;
nr2=(nr2*p+a[i])%mod2;
cs1=(cs1*p+b[i])%mod;
cs2=(cs2*p+b[i])%mod2;
pr=pr*p%mod;
p2=p2*p%mod2;
}
if(nr1==cs1 && nr2==cs2)
{
sol.push_back(sta-1);
}
for(int i=sta; i<stb; i++)
{
cs1=(cs1*p-(pr*b[i-sta])%mod+b[i])%mod;
cs2=(cs2*p-(p2*b[i-sta])%mod2+b[i])%mod2;
if(nr1==cs1 && nr2==cs2)
{
sol.push_back(i-sta+1);
}
}
out << sol.size() << '\n';
int pol=sol.size();
for(int i=0; i<min(pol,1000); i++)
{
out << sol[i] << ' ';
}
return 0;
}