Pagini recente » Cod sursa (job #1130783) | Cod sursa (job #3225967) | Cod sursa (job #142655) | Cod sursa (job #1178133) | Cod sursa (job #434140)
Cod sursa(job #434140)
/*
* File: main.cpp
* Author: SpeeDemon
*
* Created on April 4, 2010, 6:33 PM
*/
#include <string>
#include <vector>
#include <cstdlib>
#include <fstream>
#include <iterator>
#define Alpha 41
#define Modulo 1000033
/*
*
*/
using namespace std;
vector< int > v;
string pattern, ss;
inline int uint_mod( int a )
{
return ( a%Modulo + Modulo )%Modulo;
}
inline int min( int x, int y )
{
if( x > y )
return y;
return x;
}
inline void Rabin_Karp( int PatternSize, int StringSize )
{
if( PatternSize > StringSize )
return;
bool ok=true;
int i, j, k, hss, hp, E;
for( E=1, hss=hp=i=0; i < PatternSize; ++i )
{
hp=uint_mod( hp*Alpha+pattern[i] );
hss=uint_mod( hss*Alpha+ss[i] );
if( i < PatternSize-1 )
E=( 1LL*Alpha*E )%Modulo;
if( pattern[i] != ss[i] )
ok=false;
}
if( ok )
v.push_back(0);
for( ; i < StringSize; ++i )
{
hss=uint_mod( hss - uint_mod(ss[i-PatternSize]*E ) );
hss=( hss*Alpha + ss[i] )%Modulo;
if( hp == hss )
{
for( j=PatternSize-1, k=i; j >= 0; --j, --k )
if( pattern[j] != ss[k] )
break;
if( j < 0 )
v.push_back(k+1);
}
}
}
int main( void )
{
ifstream in( "strmatch.in" );
getline( in, pattern );
getline( in, ss );
char c=pattern[ pattern.size()-1 ];
if( ( c >= 'a' && c <= 'z' ) || ( c >= 'A' && c <= 'Z' ) || ( c >= '0' && c <= '9' ) )
Rabin_Karp( pattern.size(), ss.size() );
else Rabin_Karp( pattern.size()-1, ss.size() );
ofstream out( "strmatch.out" );
out<<v.size()<<'\n';
copy( v.begin(), v.begin()+min( v.size(), 1000 ), ostream_iterator<int>(out, " ") );
out<<'\n';
return EXIT_SUCCESS;
}