Cod sursa(job #883557)
Utilizator | Data | 20 februarie 2013 09:43:56 | |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#define maxn 2000005
using namespace std;
char *p,a[maxn],b[maxn];
vector < int > st;
int i;
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(a); gets(b);
p = strstr(b,a);
while(p>0)
{
st.push_back(p-b);
p = strstr(p+1,a);
}
printf("%d\n",st.size());
for(i=0; i<st.size(); ++i)
printf("%d ",st[i]);
return 0;
}