Pagini recente » Cod sursa (job #1990959) | Cod sursa (job #1015477) | Cod sursa (job #3283811) | Cod sursa (job #869198) | Cod sursa (job #2629837)
#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
const int P = 62;
const int NMAX = 2e6 + 7;
const int m1 = 1e5 + 7;
int N,M,P1,hashA1,hash1;
vector <int> a;
char A[NMAX],B[NMAX];
int main()
{
fin >> A >> B;
N=strlen(A), M=strlen(B);
P1=1;
for(int i=0;i<N;i++)
{
hashA1=(hashA1*P+A[i])%m1;
hash1=(hash1*P+B[i])%m1;
if(i!=0)
P1=(P1*P)%m1;
}
if(hashA1==hash1)
a.push_back(0);
for(int i=N;i<M;i++)
{
hash1=((hash1-(P1*B[i-N])%m1)*P+B[i])%m1;
if(hash1==hashA1)
a.push_back(i-N+1);
}
fout << a.size() << "\n";
for(int i=0;i<a.size();i++)
{
if(i==1000)
break;
fout << a[i] << " ";
}
return 0;
}