Pagini recente » Cod sursa (job #3275627) | Cod sursa (job #2970190) | Cod sursa (job #939274) | Cod sursa (job #252780) | Cod sursa (job #3231674)
#include <bits/stdc++.h>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
string s,sub;
vector <int> v;
#define mod1 666013
#define mod2 10003
int n,m,v1,v2,h1,h2,p1,p2,k;
const int p=101,r=127;
int main()
{
f>>sub>>s;
for(int i=0;sub[i];++i)
{
n++;
h1=(h1*p+sub[i])%mod1;
h2=(h2*p+sub[i])%mod2;
if(i!=0) {p1=(p*p1)%mod1;p2=(p*p2)%mod2;}
v1=(v1*p+s[i])%mod1;
v2=(v2*p+s[i])%mod2;
}
if(h1==v1 && h2==v2) return 0;
for(int i=n;s[i];++i)
{
v1=((v1-(s[i-n]*p1)%mod1+mod1)*p+s[i])%mod1;
v2=((v2-(s[i-n]*p2)%mod2+mod2)*p+s[i])%mod2;
if(v1==v2)
{
if(k<1001) v.push_back(i);
k++;
}
}
g<<k<<'\n';
for(int i=0;i<k;++i) g<<v[i]<<' ';
return 0;
}