Pagini recente » Cod sursa (job #1464342) | Borderou de evaluare (job #826670) | Cod sursa (job #2198796) | Cod sursa (job #656065) | Cod sursa (job #847915)
Cod sursa(job #847915)
#include <fstream>
#include <string>
using namespace std;
ifstream fi("strmatch.in");
ofstream fo("strmatch.out");
string a,b;
int h1,k1,h2,k2,n,m,i,v[3000000],vn;
const int mod=10000000;
int main(){
fi >> a >> b; n = a.size(); m = b.size();
if (n>m) { fo << "0"; return 0; }
for (i=0; i<n; i++){
k1 += a[i] % mod; k2 *= a[i] % mod;
h1 += b[i] % mod; h2 *= b[i] % mod;
}
if ((k1==h1)&&(k2==h2)&&(b.substr(0,n)==a)) vn++;
for (i=n; i<m; i++){
h1 = (h1-b[i-n]+b[i])%mod; h2 = (h2/b[i-n]*b[i])%mod;
if ((k1==h1)&&(k2==h2)&&(b.substr(i-n+1,n)==a)) v[vn++] = i-n+1;
}
fo << vn << "\n";
for (i=0; i<vn && i<1000; i++) fo << v[i] << " ";
return 0;
}