Pagini recente » Cod sursa (job #2951785) | Cod sursa (job #2261956) | Cod sursa (job #87546) | Cod sursa (job #114627) | Cod sursa (job #2473712)
#include <bits/stdc++.h>
using namespace std;
ifstream f("abc2.in");
ofstream g("abc2.out");
const int MOD = 666013;
typedef unsigned int ii;
vector <ii> v[MOD];
string s,st;
ii n,m,pos,put[35],ans;
void add(ii x){
v[pos].push_back(x);
}
bool is(ii x){
for(ii it: v[pos])
if(it == x)
return 1;
return 0;
}
int main(){
ii i,x;
f >> s;
put[0] = 1;
for(i = 1 ; i <= 20 ; i++)
put[i] = put[i - 1] * 3;
while(f >> st){
x = 0;
for(i = 0 ; i < st.size() ; i++){
x += put[i] * (st[i] - 'a' + 1);
}
if(!is(x))
add(x);
}
n = st.size();
x = 0;
for(i = 0 ; i < n ; i++){
x += put[i] * (s[i] - 'a' + 1);
}
if(is(x))
ans++;
for(i = n ; i < s.size() ; i++){
x -= (s[i - n] - 'a' + 1);
x /= 3;
x += (s[i] - 'a' + 1) * put[n - 1];
if(is(x))
ans++;
}
g << ans;
return 0;
}