Pagini recente » Istoria paginii utilizator/ionfier | Atasamentele paginii 1.i | Cod sursa (job #2707598) | Diferente pentru runda/supers intre reviziile 10 si 6 | Cod sursa (job #2296931)
#include <fstream>
#include <ctype.h>
#include <ctype.h>
#include<vector>
#include<cstring>
#define prim 60031
using namespace std;
char text[10000002], word[21];
vector<unsigned int> Hash[prim];
unsigned int pow3[21], cod, key, dim, n,m, match = 0, i, j;
ifstream cin("abc2.in");
ofstream cout("abc2.out");
int type(char word[21]) {
char x;
int m = 0;
while ( x != '\n' or x != '\0'){
cin >> x;
text[++m] = x;
}
if ( m )
return true;
return false;
}
int main()
{
pow3[0] = 1;
for( i = 1; i<=21; ++i) pow3[i] = pow3[i-1]*3;
cin >> text;
m = strlen(text);
while(cin>>(word))
{
n = strlen(word);
cod = 0;
for(i = 0; i<n; ++i) cod += (word[i] - 'a')*pow3[i];
Hash[cod%prim].push_back(cod);
}
cod = 0;
for( i = 0; i<n; ++i){
cod+=(text[i] - 'a')*pow3[i];
}
for(; i<m; ++i){
key = cod%prim;
dim = Hash[key].size();
for( j = 0; j<dim; ++j){
if(Hash[key][j]==cod){
match++;
break;
}
}
cod/=3;
cod+=pow3[n-1]*(text[i]-'a');
}
key = cod%prim;
dim = Hash[key].size();
for(i = 0; i<dim; ++i){
if(Hash[key][i]==cod){
match++;
break;
}
}
cout<<match;
return 0;
}