Pagini recente » Cod sursa (job #2884002) | Cod sursa (job #774500) | Cod sursa (job #1557345) | Cod sursa (job #2987230) | Cod sursa (job #2279816)
#include <fstream>
#include <cstring>
#include <cstdlib>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char A[2000005],B[2000005],y;
int nA,nB,i,j,fA[300],fB[300],mA,mB,xmin,z[1002],nr,ok,x,q;
int main()
{
fin>>A>>B;
nA=0;mA=0;
while(A[nA]){
x=(int)A[nA];
fA[x]++;
if(fA[x]==1)mA++;
nA++;
}
mB=0;ok=1;nr=0;
for(i=0;i<nA;i++){
x=(int)B[i];
fB[x]++;
if(fB[x]==fA[x])mB++;
else if(fB[x]==1+fA[x])mB--;
if(B[i]!=A[i])ok=0;
}
if(ok==1){
nr++;
if(nr<=1000){
z[nr]=0;
}
}
for(i=nA;B[i]!=0;i++){
q=(int)B[i-nA];
fB[q]--;
if(fB[q]==fA[q]-1) mB--;
else if(fB[q]==fA[q]) mB++;
x=(int)B[i];
fB[x]++;
if(fB[x]==fA[x])mB++;
else if(fB[x]==1+fA[x])mB--;
if(mA==mB){
ok=1;
for(j=0;j<nA;j++){
if(A[j]!=B[i-nA+1+j]){
ok=0;break;
}
}
if(ok==1 && mB==mA){
nr++;
if(nr<=1000){
z[nr]=i-nA+1;
}
}
}
}
fout<<nr<<"\n";
for(i=1;i<=nr && i<=1000;i++){
fout<<z[i]<<" ";
}
fout.close();
fin.close();
return 0;
}