Pagini recente » Cod sursa (job #2169044) | Cod sursa (job #499808) | Cod sursa (job #2455125) | Cod sursa (job #1718965) | Cod sursa (job #2719694)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[2000001], b[2000001];
int n, m;
vector<int> ans;
bool apare(int i)
{
for(int j=i; j<i+n; j++)
if(b[j]!=a[j-i])
return false;
return true;
}
int main()
{
fin >> a;
fin >> b;
n=strlen(a);
m=strlen(b);
for(int i=0; i<=m-n; i++)
if(apare(i))
ans.push_back(i);
fout << ans.size() << "\n";
if(ans.size()<=1000)
for(int i=0; i<ans.size(); i++)
fout << ans[i] << " ";
else
for(int i=0; i<1000; i++)
fout << ans[i] << " ";
return 0;
}