Pagini recente » Cod sursa (job #847496) | Cod sursa (job #45367) | Cod sursa (job #1376962) | Cod sursa (job #1422594) | Cod sursa (job #1498977)
#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
#define MAX 2000010
vector<int> rez;
char a[MAX], b[MAX];
int pi[MAX];
int main()
{
int m;
int n, i, ptr;
fin >> (a + 1);
fin >> (b + 1);
n = strlen(a + 1);
m = strlen(b + 1);
ptr = 0;
for(i = 1 ; i <= n ; i++)
{
while(ptr && a[i] != a[ptr + 1])
ptr = pi[ptr];
if(a[i] == a[ptr + 1] && i != 1)
ptr ++;
pi[i] = ptr;
}
ptr = 0;
for(i = 1 ; i <= m ; i++)
{
while(ptr && b[i] != a[ptr + 1])
ptr = pi[ptr];
if(b[i] == a[ptr + 1])
ptr++;
if(ptr == n)
{
rez.push_back(i - n);
ptr = pi[ptr];
}
}
fout << rez.size() << "\n";
m = rez.size();
m = min(m, 1000);
for(i = 0 ; i < m ; i++)
{
fout << rez[i] << " ";
}
fout << "\n";
}