Pagini recente » Cod sursa (job #2818022) | Cod sursa (job #3197242) | Cod sursa (job #2810272) | Cod sursa (job #3286172) | Cod sursa (job #2424244)
#include <iostream>
#include <fstream>
#include <cstring>
#define LMAX 2000001
using namespace std;
char a[LMAX], b[LMAX];
int main()
{
ifstream in("strmatch.in");
ofstream fout("strmatch.out");
in.getline(a ,LMAX);
in.getline(b, LMAX);
int counter = 0, v[1000];
for(int i = 0; i<strlen(b); i++)
{
bool ok = true;
int adder = 0;
for(int j = 0; j<strlen(a) && ok; j++)
if(a[j] == b[i + adder])
adder++;
else
ok = false;
if(ok)
v[counter++] = i;
}
fout << counter << endl;
for(int i = 0; i<counter; i++)
fout << v[i] <<" ";
return 0;
}