Pagini recente » Cod sursa (job #116255) | Cod sursa (job #507204) | Cod sursa (job #3133031) | Cod sursa (job #2613906) | Cod sursa (job #2893027)
#include <iostream>
#include <cstring>
#include <fstream>
using namespace std;
char A[2000000], B[2000000];
int main() {
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
fin >> A;
fin >> B;
int start[20000], pos = 0, Alg = strlen(A), Blg = strlen(B), lg, k, total = 0;
for (int i = 0; i < Blg; ++i) {
if (B[i] == A[0]) {
lg = 0, k = 0;
int j = i;
while (B[j] == A[k]) {
++lg;
++k;
++j;
}
if (lg == Alg) {
start[pos] = i;
++pos;
++total;
}
}
}
fout << total << '\n';
for (int i = 0; i < pos; ++i) {
fout << start[i] << ' ';
}
return 0;
}