Pagini recente » Cod sursa (job #1420821) | Cod sursa (job #2246248) | Cod sursa (job #2602114) | Cod sursa (job #628786) | Cod sursa (job #2910784)
#include <iostream>
#include <cstring>
#include <fstream>
#include <vector>
#define MAX 2000002
using namespace std;
char a[MAX],b[MAX],p[MAX];
vector<int> sol;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int main()
{
fin >> a+1;
fin >> b+1;
int lenA = strlen(a+1);
int lenB = strlen(b+1);
int l = 0;
for(int i = 2; i <= lenA; i++){
while(l != 0 && a[i] != a[l+1]){
l = p[l];
}
if(a[i] == a[l+1]){
l++;
}
p[i] = l;
}
l = 0;
int ans = 0;
for(int i = 1; i <= lenB; i++){
while(l != 0 && b[i] != a[l+1]){
l = p[l];
}
if(b[i] == a[l+1]){
l++;
}
if(l == lenA){
ans++;
if(sol.size() < 1000){
sol.push_back(i-lenA);
}
l = p[l];
}
}
fout << ans << "\n";
for(int i = 0; i < sol.size(); i++){
fout << sol[i] << " ";
}
return 0;
}