Pagini recente » Cod sursa (job #1608320) | Cod sursa (job #2775139) | Cod sursa (job #303084) | Cod sursa (job #1129783) | Cod sursa (job #2312718)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
const int NMAX=2e6+5;
char c[NMAX],t[NMAX];
vector <int> v;
void citire()
{
fin>>c>>t;
}
void solve()
{
int lc,lt;
lc=strlen(c);
lt=strlen(t);
for(int d=0;d<=lt-lc;d++)
{
bool ok=1;
for(int j=d;j<=d+lc-1;j++)
if(c[j-d]!=t[j])
ok=0;
if(ok)
v.push_back(d);
}
}
void afisare()
{
fout<<v.size()<<'\n';
for(int i=0;i<v.size();i++)
fout<<v[i]<<" ";
}
int main()
{
citire();
solve();
afisare();
return 0;
}