Pagini recente » Cod sursa (job #24386) | Cod sursa (job #963689) | Cod sursa (job #2285563) | Cod sursa (job #791097) | Cod sursa (job #2071859)
#include <fstream>
#include <queue>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[2000002], b[2000002];
queue<int> q;
int k;
int main()
{
fin.getline(a, 2000001);
fin.getline(b, 2000001);
for (int i = 0; b[i]; i++)
{
int j = 0;
while (a[j] && b[i + j] == a[j]) j++;
if (!a[j])
q.push(i);
}
fout << q.size() << '\n';
while (q.size())
{
fout << q.front() << ' ';
q.pop();
}
}