Pagini recente » Cod sursa (job #563693) | Cod sursa (job #2084738) | Cod sursa (job #1888537) | Cod sursa (job #1365786) | Cod sursa (job #2718294)
#include <fstream>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int main()
{
string a, b;
fin >> a >> b;
int nr = 0, pos[1005], p_in = 0;
int n = b.size();
int m = a.size();
for (int i = 0; i < n; i++)
{
if (p_in >= 1000) break;
int j = i;
int p = 0;
while(b[j] == a[p] && j < n && p < m)
j++, p++;
if (p == m) nr++, pos[p_in++] = i;
}
fout << nr << '\n';
for (int i = 0; i < p_in; i++) fout << pos[i] << " ";
fin.close();
fout.close();
return 0;
}