Pagini recente » Cod sursa (job #2855387) | Cod sursa (job #84161) | Cod sursa (job #1263392) | Cod sursa (job #2372357) | Cod sursa (job #1373874)
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int pi[2000001];
vector <int>sol;
void prefix(string a)
{
int n=a.size(), k=0;
pi[1]=0;
for(int i=2;i<=n;i++)
{
while(k>0 && a.at(k+1)==a.at(i))
k=pi[k];
if(a.at(k+1)==a.at(i))
k++;
pi[i]=k;
}
}
void solve(string a,string b)
{
prefix(a);
int n=a.size(),m=b.size(),k=0;
for(int i=1;i<=m;i++)
{
while(k>0 && a.at(k+1)==b.at(i))
k=pi[k];
if(a.at(k+1)==b.at(i))
k++;
if(k==n)
{
sol.push_back(i-n+1);
if(sol.size()==1000)
break;
}
}
g<<sol.size()<<"\n";
for(int i=0;i<sol.size();i++)
g<<sol.at(i)<<" ";
}
int main()
{
string a,b;
f>>a;
f.get();
f>>b;
f.close();
solve(a,b);
}