Pagini recente » Cod sursa (job #2934150) | Cod sursa (job #1884282) | Cod sursa (job #2129673) | Cod sursa (job #1796275) | Cod sursa (job #2555376)
#include <iostream>
#include <fstream>
#include <string>
#include <bitset>
using namespace std;
typedef long long lint;
lint cv(char c){
return c-'a';
}
const lint c1 = 500041;
const lint c2 = 800441;
bitset<c1> bi;
bitset<c2> wi;
struct roller{
const lint alp = 3;
lint val = 0, rm = 1;
void extend(char a){
val = (val*alp)+cv(a);
rm *= alp;
}
void extend(const string &s){
for(auto c : s){
extend(c);
}
}
void roll(char a, char b){
val = (val*alp) - rm*cv(a) + cv(b);
}
void setz(){
bi[val%c1] = true;
wi[val%c2] = true;
}
bool chek(){
return bi[val%c1]&&wi[val%c2];
}
};
ifstream fin("abc2.in");
ofstream fout("abc2.out");
string s, q;
void altoire(const string &a){
roller r;
r.extend(a);
r.setz();
}
int n;
int sol = 0;
void rezolvescu(){
roller r;
for(int i = 0; i < n; ++i){
r.extend(s[i]);
}
if(r.chek()){
sol++;
}
for(int i = n; i < s.size(); ++i){
r.roll(s[i-n], s[i]);
if(r.chek()){
sol++;
}
}
fout << sol;
}
int main(){
ios_base::sync_with_stdio(false);
fin >> s;
while(fin >> q){
n = q.size();
altoire(q);
}
rezolvescu();
return 0;
}