Pagini recente » Cod sursa (job #3216326) | Cod sursa (job #2585217) | Cod sursa (job #2959978) | Cod sursa (job #167136) | Cod sursa (job #2082332)
#include <iostream>
#include <string>
#include <cstdio>
using namespace std;
const int MAX = 1000;
const int L = 2000000;
int ans[MAX];
char s[L + 1];
std::string s1, s2;
int main() {
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
scanf("%s\n", s);
s2 = s;
scanf("%s", s);
s1 = s;
//scanf("%s",s2);
int c = 0;
int f = -1;
int k = 0;
while(true) {
f = s1.find(s2, f + 1);
if(f == string::npos)
break;
c++;
if(c <= MAX)
ans[k++] = f;
}
cout << c << endl;
for(int i = 0; i < k; i++)
cout << ans[i] << " ";
return 0;
}