Pagini recente » Cod sursa (job #2389649) | Cod sursa (job #2822140) | Cod sursa (job #2236035) | Cod sursa (job #2234124) | Cod sursa (job #2810463)
#include <bits/stdc++.h>
#define nmax 2000000
using namespace std;
string prob="strmatch";
ifstream in(prob+".in");
ofstream out(prob+".out");
int z[nmax*2];
int apar[1005];
int si=0;
string s,tmp;
int n,m;
int main(){
in>>s>>tmp;
m=s.size();
s+="$"+tmp;
n=s.size();
int x,y;
x=y=0;
for(int i=1;i<n;i++){
z[i]=max(0,min(z[i-x],y-i+1));
while(i+z[i]<n&&s[z[i]]==s[i+z[i]]){
x=i;
y=i+z[i];
z[i]++;
}
if(i>m){
if(z[i]==m){
if(si<1000)apar[si]=i-m-1;
si++;
}
}
}
out<<si<<'\n';
for(int i=0;apar[i];i++)out<<apar[i]<<' ';
}