Pagini recente » Cod sursa (job #289138) | Cod sursa (job #2739255) | Cod sursa (job #1987393) | Cod sursa (job #2593715) | Cod sursa (job #928072)
Cod sursa(job #928072)
// Include
#include <fstream>
#include <cstring>
using namespace std;
// Constante
const int sz = (int)2e6+3;
// Functii
void makePrefix();
// Variabile
ifstream in("strmatch.in");
ofstream out("strmatch.out");
char str[sz], sub[sz];
int subLen, strLen;
int prefix[sz];
int answer, answers[1001];
// Main
int main()
{
in >> (sub+1) >> (str+1);
strLen = strlen(str+1);
subLen = strlen(sub+1);
makePrefix();
int currentPrefix = 0;
for(int i=1 ; i<=strLen ; ++i)
{
while(currentPrefix && str[i] != sub[currentPrefix+1])
currentPrefix = prefix[currentPrefix];
if(str[i] == sub[currentPrefix+1])
if(++currentPrefix == subLen)
{
if(++answer <= 1000)
answers[answer] = i-subLen;
currentPrefix = prefix[currentPrefix];
}
}
out << answer << '\n';
int limit = min(answer, 1000);
for(int i=1 ; i<=limit ; ++i)
out << answers[i] << ' ';
out << '\n';
in.close();
out.close();
return 0;
}
void makePrefix()
{
int currentPrefix = 0;
for(int i=2 ; i<=subLen ; ++i)
{
while(currentPrefix && sub[i] != sub[currentPrefix+1])
currentPrefix = prefix[currentPrefix];
if(sub[i] == sub[currentPrefix+1])
++currentPrefix;
prefix[i] = currentPrefix;
}
}