Pagini recente » Cod sursa (job #2940580) | Cod sursa (job #2575137) | Cod sursa (job #309467) | Istoria paginii runda/eusebiu_oji_2005_cls11-12/clasament | Cod sursa (job #3253033)
#include <bits/stdc++.h>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
char A[4000002], B[2000002];
int N, M, pi[4000002], sol, ans[1002];
int main(){
in >> A;
N = strlen(A);
in >> B;
M = strlen(B);
A[N] = '#';
for(int i = 0; i < M; i++) A[N + i + 1] = B[i];
M = M + N + 1;
pi[0] = 0;
for(int i = 1; i < M and sol < 1000; i++){
int j = pi[i - 1];
while(j > 0 and A[i] != A[j])
j = pi[j - 1];
if(A[i] == A[j]) j = j + 1;
if(j == N){
sol = sol + 1; ans[sol] = i - N - N;
}
pi[i] = j;
}
out << sol << "\n";
for(int i = 1; i <= sol; i++) out << ans[i] << " ";
return 0;
}