Pagini recente » Borderou de evaluare (job #3331528) | Borderou de evaluare (job #3291779) | Monitorul de evaluare | Borderou de evaluare (job #3322314) | Cod sursa (job #3319085)
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,inline")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define fast ios_base::sync_with_stdio(0);f.tie(0);g.tie(0);
#define setinf(x) memset(x,0x3f3f3f3f,sizeof(x));
#define set0(x) memset(x,0,sizeof(x));
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define vi vector<int>
#define ll long long
#define vll vector<ll>
#define pb push_back
#define fi first
#define se second
#define DD 100001
#define nl '\n'
using namespace std;
const string file="abc2";
ifstream f(file+".in");
ofstream g(file+".out");
//#define f cin
//#define g cout
string s,t;
unordered_set<int>mp;
int main(){
f>>s;
while (f>>t) {
int h=0;
for (char c:t)
h=h*3+(c-'a');
mp.insert(h);
}
int n=t.size();
int p=1,r=0,h=0;
for (int i=1; i<n; ++i) p*=3;
for (int i=0; i<s.size(); ++i) {
h=h*3+(s[i]-'a');
if (i>=n-1){
if (mp.find(h)!=mp.end()) ++r;
h-=p*(s[i-n+1]-'a');
}
}
g<<r;
system("pause");
return 0;
}