Pagini recente » Cod sursa (job #338952) | Cod sursa (job #1803162) | Cod sursa (job #1983978) | Cod sursa (job #1958682) | Cod sursa (job #629524)
Cod sursa(job #629524)
#include<fstream>
#include<string>
#include<vector>
using namespace std;
const int B = 67;
const int P = 666013;
string a,b;
vector<int> Bp;
vector<int> poz;
int x;
void ReadData()
{
ifstream fin("strmatch.in");
fin>>a>>b;
}
void Baza()
{
int k = a.length(),nr;
Bp.push_back(1);
for(int i=1;i<=k;i++)
{
nr = (Bp[i-1] * B) %P;
Bp.push_back(nr);
}
}
void Solve()
{
int k = a.length();
int hashb=0,i,hasha=0;
for (i=0; i < k; i++)
{
hasha =(hasha + a[i] * Bp[k-1-i]) % P;
}
for (i=0; i < k; i++)
{
hashb =(hashb + b[i] * Bp[k-1-i]) % P;
}
int ok = 0;
if( hasha == hashb)
{
for(i=0;i<k ;i++)
if(a[i]!=b[i])
ok = 1;
if( ok == 0 )
{
poz.push_back(0);
}
}
int j = b.length();
for(i=k; i< j && poz.size() < 1000;++i)
{
hashb = (P + (hashb - b[i-k] * Bp[k-1]) * Bp[1] + b[i])%P;
if( hasha == hashb)
{
//verific;
ok = 0;
for(int q = 0; q<k; ++q )
if(a[q] != b[i-k+q+1])
ok = 1;
if( ok == 0 )
{
poz.push_back(i-k+1);
}
}
}
}
//P = 10 la a 16
void Afisare()
{
ofstream fout("strmatch.out");
int i;
fout<<poz.end()-poz.begin()<<"\n";
for(i=0;i < poz.size();i++)
fout<<poz[i]<<" ";
}
int main()
{
ReadData();
Baza();
Solve();
Afisare();
return 0;
}