Pagini recente » Cod sursa (job #910381) | Cod sursa (job #1514617) | Cod sursa (job #1978977) | Cod sursa (job #84361) | Cod sursa (job #2919509)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int todigit(char c)
{
if(islower(c)) return c-'a'+1;
if(isupper(c)) return c-'A'+27;
}
vector<int> rabin_karp(string s, string t) {
const int p = 53;
const int m = 1e9 + 9;
int S = s.size(), T = t.size();
vector<long long> p_pow(max(S, T));
p_pow[0] = 1;
for (int i = 1; i < (int)p_pow.size(); i++)
p_pow[i] = (p_pow[i-1] * p) % m;
vector<long long> h(T + 1, 0);
for (int i = 0; i < T; i++)
h[i+1] = (h[i] + todigit(t[i]) * p_pow[i]) % m;
long long h_s = 0;
for (int i = 0; i < S; i++)
h_s = (h_s + todigit(s[i]) * p_pow[i]) % m;
vector<int> occurences;
for (int i = 0; i + S - 1 < T; i++) {
long long cur_h = (h[i+S] + m - h[i]) % m;
if (cur_h == h_s * p_pow[i] % m)
occurences.push_back(i);
}
return occurences;
}
int main()
{
string s,t;
fin>>s>>t;
vector<int>occurences=rabin_karp(s,t);
fout<<occurences.size()<<"\n";
for(auto x:occurences) fout<<x<<" ";
return 0;
}