Pagini recente » Cod sursa (job #57027) | Cod sursa (job #1648369) | Cod sursa (job #3160677) | Cod sursa (job #539581) | Cod sursa (job #2657133)
#include <fstream>
#include <vector>
using namespace std;
const long long baza = 999999937;
const long long m = 999999931;
vector<long long> v;
long long rasp;
string a, b;
int main()
{
ifstream fin( "strmatch.in" );
fin >> a >> b;
fin.close();
if( a.size() > b.size() ){
FILE *fout = fopen( "strmatch.out", "w" );
fprintf( fout, "0\n" );
fclose( fout );
} else {
long long vala = 0;
long long valb = 0;
long long put = 1, i;
for( i = 0; i < a.size(); i++ ){
vala = ( vala * baza + a[ i ] ) % m;
put = ( put * baza ) % m;
}
for( i = 0; i < a.size(); i++ )
valb = ( valb * baza + b[ i ] ) % m;
if( vala == valb ){
++rasp;
v.push_back( 0 );
}
for( i = 1; i <= b.size() - a.size(); i++ ){
valb = ( valb * baza + b[ i + a.size() - 1 ] ) % m;
long long ceva = ( put * b[ i - 1 ] ) % m;
valb = ( valb - ceva + m ) % m;
if( vala == valb ){
++rasp;
if( v.size() < 1000 )
v.push_back( i );
}
}
FILE *fout = fopen( "strmatch.out", "w" );
fprintf( fout, "%lld\n", rasp );
for( i = 0; i < v.size(); i++ )
fprintf( fout, "%lld ", v[ i ] );
fprintf( fout, "\n" );
fclose( fout );
}
return 0;
}