Pagini recente » Borderou de evaluare (job #1389) | Atasamentele paginii Profil danyelutza | Rezultatele filtrării | Cod sursa (job #2547622) | Cod sursa (job #2322757)
#include <fstream>
#include <cstring>
#include <queue>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
string a,b;
queue <int> q;
int t,x;
int main()
{
f>>b>>a;
while(t<1000 && a.find(b)!=string::npos)
{
q.push(a.find(b)+x+t);
x+=a.find(b);
a.erase(0,a.find(b)+1);
t++;
}
g<<t<<'\n';
while(!q.empty())
{
g<<q.front()<<' ';
q.pop();
}
}