Pagini recente » Cod sursa (job #760292) | Cod sursa (job #1635075) | Cod sursa (job #1254873) | Cod sursa (job #3235877) | Cod sursa (job #2802239)
#include <bits/stdc++.h>
using namespace std;
#define int unsigned int
ifstream in("abc2.in");
ofstream out("abc2.out");
const int MOD = 90907;
struct Hash {
vector<vector<int>> h;
Hash() : h(MOD, vector<int>{}) {}
void insert(string &s) {
int x = 0;
for (int i = 0; i < (int)s.size(); i++) {
x = x * 3 + s[i] - 'a';
}
h[x % MOD].push_back(x);
}
bool find(int x) {
int xh = x % MOD;
for (int val : h[xh])
if (val == x)
return true;
return false;
}
};
signed main() {
ios_base::sync_with_stdio(false);
in.tie(NULL);
string s; in >> s;
vector<int> v;
Hash H;
int l = 0;
string c; while (in >> c) {
H.insert(c);
l = (int)c.size();
}
int p = 1, x = 0;
for (int i = 0; i < l; i++) {
x = x * 3 + s[i] - 'a';
if (i > 0)
p *= 3;
}
int ans = 0;
if (H.find(x))
ans++;
for (int i = l; i < (int)s.size(); i++) {
x = (x - p * (s[i - l] - 'a')) * 3 + s[i] - 'a';
if (H.find(x))
ans++;
}
out << ans << "\n";
return 0;
}