Pagini recente » Cod sursa (job #2292902) | Cod sursa (job #1901481) | Cod sursa (job #1051198) | Cod sursa (job #704152) | Cod sursa (job #2366106)
#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];
unsigned count, pos;
int main()
{
in >> s >> t;
while(true)
{
char *p = strstr(t + pos + 1, s);
if(!p)
break;
pos = p - t;
++count;
if(count <= 1000)
q.push(pos);
}
out << count << '\n';
while(!q.empty())
{
out << q.front() << ' ';
q.pop();
}
return 0;
}