Pagini recente » Cod sursa (job #851939) | Cod sursa (job #1662391) | winter-challenge-1/rezultate-11-12 | Cod sursa (job #1755569) | Cod sursa (job #2420144)
//#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
const int Max=2000005;
char a[Max],b[Max],*p;
vector < int >poz;
int nr,j;
int main()
{
in>>a>>b;
for(int i=0;i<strlen(b);i++)
if(b[i]==a[0])
{
bool ok=1; int c=1;
for(j=i+1;j<strlen(b) && c<strlen(a) && ok;j++)
if(b[j]!=a[c++])
ok=0;
if(ok==1 && c!=strlen(a))
ok=0;
if(ok==1)
{
nr++;
if(nr<=1000)
poz.push_back(i);
}
}
out<<nr<<"\n";
for(int i=0;i<poz.size();i++)
out<<poz[i]<<" ";
return 0;
}