Pagini recente » Cod sursa (job #2617555) | Cod sursa (job #1835632) | Cod sursa (job #3283871) | Cod sursa (job #635939) | Cod sursa (job #2443189)
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <set>
#include <list>
#include <deque>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
string v;
string w;
vector <int>vect;
vector <int>::iterator it;
deque <char> vect1;
deque <char> vect2;
/*void functie(string v,string w, int n,int m)
{
int s1=0,s2=0,s3=0,i,j;
for(i=0;i<n;i++)
{
s1+=v[i]*(i+1);
s2+=w[i]*(i+1);
s3+=w[i];
}
if(s1==s2)
vect.insert(0);
i=0;
for(j=n;j<m;i++,j++)
{
s2-=s3;
s3-=w[i];
s2+=(j-i)*w[j];
s3+=w[j];
if(s1==s2)
vect.insert(i+1);
}
fout<<vect.size()<<"\n";
for(it=vect.begin();it!=vect.end();it++)
fout<<*it<<" ";
}
*/
void functie2(string v,string w, int n,int m)
{
int s1=0,s2=0,i,j;
for(i=0;i<n;i++)
{
vect1.push_back(v[i]);
vect2.push_back(w[i]);
}
if(vect1==vect2)
vect.push_back(0);
i=0;
for(j=n;j<m;i++,j++)
{
vect2.pop_front();
vect2.push_back(w[j]);
if(vect1==vect2)
vect.push_back(i+1);
}
fout<<vect.size()<<"\n";
for(it=vect.begin();it!=vect.end();it++)
fout<<*it<<" ";
}
int main()
{
int n,m;
getline(fin,v);
getline(fin,w);
n=v.size();
m=w.size();
if(n<m)
functie2(v,w,n,m);
else
functie2(w,v,m,n);
return 0;
}