Pagini recente » Cod sursa (job #2882191) | Cod sursa (job #983870) | Cod sursa (job #2765304) | Cod sursa (job #3039190) | Cod sursa (job #2555508)
#include <iostream>
#include <fstream>
#include <string>
#include <bitset>
#include <vector>
#include <cmath>
using namespace std;
typedef unsigned int uint;
uint cv(char c){
return c-'a';
}
const uint c1 = 666013;
const uint alp = 3;
uint rm;
vector<uint> ve[c1];
struct roller{
uint val = 0;
void extend(char a){
val = (val*alp)+cv(a);
}
void extend(const string &s){
for(auto c : s){
extend(c);
}
}
void roll(char a, char b){
val = (val - rm*cv(a))*alp + cv(b);
}
bool chek(){
const vector<uint> &v = ve[val%c1];
for(auto a : v){
if(a == val){
return true;
}
}
return false;
}
void setz(){
if(!chek()){
ve[val%c1].push_back(val);
}
}
};
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);
}
rm = pow(alp, n-1);
rezolvescu();
return 0;
}