Pagini recente » Cod sursa (job #2557797) | Cod sursa (job #1804003) | Cod sursa (job #1019484) | Cod sursa (job #2855757) | Cod sursa (job #1575965)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
const int Nmax = 2000001;
char s1[Nmax];
char s2[Nmax];
int N1, N2;
const int Mod1 = 10007;
const int Mod2 = 666013;
const int B1 = 27;
const int B2 = 29;
int val1_s1;
int val1_s2;
int val2_s1;
int val2_s2;
int putere1, putere2;
int match[Nmax];
int nr;
int main ()
{
f.getline(s1, sizeof(s1));
f.getline(s2, sizeof(s2));
N1 = strlen(s1);
N2 = strlen(s2);
if(N1 > N2) { g << "0" << '\n'; return 0; }
putere1 = 1;
putere2 = 1;
for(size_t i = 0; i < N1; i ++)
{
val1_s1 = (val1_s1 * B1 + s1[i]) % Mod1;
val2_s1 = (val2_s1 * B2 + s1[i]) % Mod2;
if(i != 1)
{
putere1 = (putere1 * B1) % Mod1;
putere2 = (putere2 * B2) % Mod2;
}
}
for(size_t i = 0; i < N1; i ++)
{
val1_s2 = (val1_s2 * B1 + s2[i]) % Mod1;
val2_s2 = (val2_s2 * B2 + s2[i]) % Mod2;
}
if(val1_s1 == val1_s2 && val2_s1 == val2_s2) { nr ++; match[0] = 1; }
for(size_t i = N1; i < N2; i ++)
{
val1_s2 = ( (val1_s2 - (s2[i - N1] * putere1) % Mod1 + Mod1) * B1 + s2[i] ) % Mod1;
val2_s2 = ( (val2_s2 - (s2[i - N1] * putere2) % Mod2 + Mod2) * B2 + s2[i] ) % Mod2;
if(val1_s1 == val1_s2 && val2_s1 == val2_s2) { nr ++; match[i - N1 + 1] = 1; }
}
g << nr << '\n';
nr = 0;
for(int i = 0; i < N2; i ++)
if(match[i] == 1) {nr ++; g << i << ' '; if(nr == 1000) break; }
g << '\n';
return 0;
}