Pagini recente » Cod sursa (job #961708) | Cod sursa (job #1713325) | Cod sursa (job #2645247) | Cod sursa (job #1951301) | Cod sursa (job #1488003)
#include <fstream>
#include <vector>
#include <cstring>
#define Xp 50003
using namespace std;
ifstream f("abc2.in");
ofstream g("abc2.out");
int nr,i,l,n,j;
unsigned int a,q[23];
char w[10000012],c[24];
vector <unsigned int> M[Xp+2];
bool caut(unsigned int jeg)
{
int r=jeg%Xp,z=M[jeg%Xp].size();
for(j=0;j<z;++j)
if(M[r][j]==jeg) return 1;
return 0;
}
int main()
{
f>>(w+1);
l=strlen(w+1);
q[1]=1;
for(i=2;i<=20;++i) q[i]=q[i-1]*3;
while(f>>(c+1))
{
n=strlen(c+1);
for(i=1,a=0;i<=n;++i) a=a+q[i]*(c[i]-'a');
M[a%Xp].push_back(a);
}
for(i=1,a=0;i<=n;++i) a=a+q[i]*(w[i]-'a');
nr+=caut(a);
for(i=n+1;i<=l;++i) {a/=3; a=a+q[n]*(w[i]-'a'); nr+=caut(a);}
g<<nr;
return 0;
}