Pagini recente » Cod sursa (job #2316475) | Cod sursa (job #2151069) | Cod sursa (job #1343684) | Monitorul de evaluare | Cod sursa (job #2968557)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int main()
{
string A, B;
vector<int> poz;
unsigned long long hashA=0,hashB=0,p=31,power=1;
fin>>A>>B;
for(int i=0;i<A.size();i++)
{
hashA=hashA*p+A[i];
hashB=hashB*p+B[i];
power*=p;
}
if(hashA==hashB)poz.push_back(0);
for(int i=A.size();i<B.size();i++)
{
hashB=hashB*p + B[i] - B[i-A.size()] * power;
if(hashA==hashB)
poz.push_back(i-A.size()+1);
}
fout<<poz.size()<<'\n';
for(int i=0;i<1000 && i<poz.size();i++)
fout<<poz[i]<<' ';
return 0;
}