Pagini recente » Cod sursa (job #839575) | Cod sursa (job #2310385) | Cod sursa (job #2864150) | Cod sursa (job #1124684) | Cod sursa (job #921102)
Cod sursa(job #921102)
#include <fstream>
#include <string>
#include <vector>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
string A, B;
int T[2000001];
vector<int> sol;
int main()
{
fin>>A>>B;
for(int i=1;i<A.length();i++)
{
if(A[ T[i-1] ] == A[i])
T[i] = 1 + T[i-1];
else if(A[i]==A[0])
T[i] = 1;
}
int k = 0;
for(int i=0;i<B.length();i++)
{
do
{
k++,i++;
}while(A[k] == B[i] && k<A.length() && i<B.length());
k--,i--;
if(k==A.length()-1)
sol.push_back(i);
k = T[k];
}
fout<<sol.size()<<'\n';
for(size_t i = 0; i<sol.size();i++)
fout<<sol[i]-A.length()+1<<' ';
fin.close();
fout.close();
return 0;
}