Pagini recente » Atasamentele paginii Clasament vacanta_11_5 | Cod sursa (job #1710858) | Cod sursa (job #1641063) | Cod sursa (job #2615834) | Cod sursa (job #2214816)
#include <stdio.h>
#include <cstring>
#include <set>
using namespace std;
#define NMAX 2000000
int main () {
char a[NMAX], b[NMAX];
int alen, blen, counter;
set<int> pos;
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
scanf("%s", a);
scanf("%s", b);
alen = strlen(a);
blen = strlen(b);
for (int i = 0; i < blen - alen; i++) {
int OK = 1;
for (int j = 0; j < alen; j++) {
if (b[i + j] != a[j]) {
OK = 0;
break;
}
}
if (OK) {
counter++;
pos.insert(i);
}
}
printf("%d\n", counter);
for (auto elem : pos) {
printf("%d ", elem);
}
printf("\n");
return 0;
}