Pagini recente » Cod sursa (job #1267991) | Cod sursa (job #2048313) | Cod sursa (job #1796085) | Cod sursa (job #3210199) | Cod sursa (job #2366085)
#include <fstream>
#include <cstring>
#include <queue>
#define len 2000001
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
queue<unsigned> q;
char s[len], t[len];
int main()
{
in >> s >> t;
q.push(0);
while(true)
{
char *p = strstr(t + q.back() + 1, s);
if(!p)
break;
q.push(p - t);
}
q.pop();
out << q.size() << '\n';
while(!q.empty())
{
out << q.front() << ' ';
q.pop();
}
return 0;
}