Cod sursa(job #2296852)

Utilizator cahemanCasian Patrascanu caheman Data 5 decembrie 2018 01:26:54
Problema Abc2 Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.22 kb
#include<cstdio>
#include<vector>
#include<string>

using namespace std;

char text[10000005];
char cuv[25];

vector <int> hh[10041];
int lung[10041];

unsigned int p;

void hashuire(long long x)
{
  int m;
  int i;
  m = x % 10041;
  for(i = 0; i < lung[m]; ++ i)
    if(hh[m][i] == x / 100)
      return ;
  hh[m].push_back(x / 100);
  ++ lung[m];
}

bool verif(long long x)
{
  int m;
  int i;
  m = x % 10041;
  for(i = 0; i < lung[m]; ++ i)
    if(hh[m][i] == x / 100)
      return 1;
  return 0;
}

int main()
{
  freopen("abc2.in", "r", stdin);
  freopen("abc2.out", "w", stdout);
  long long x, p;
  int n, i, j, nr = 0, m = 0;
  scanf("%s", &text);
  n = 0;
  while(text[n] != '\0')
  {
      ++ n;
  }
  while(scanf("%s", &cuv) != EOF)
  {
    x = 0;
    if(m == 0)
    {
        while(cuv[m] != '\0')
        {
            ++ m;
        }
    }
    for(i = 0; i < m; ++ i)
      x = x * 3 + cuv[i] - 'a';
    hashuire(x);
  }
  x = 0;
  p = 1;
  for(i = 1; i <= m; ++ i)
    p = p * 3;
  for(i = 0; i < n; ++ i)
  {
    x = x * 3 + text[i] - 'a';
    while(x >= p)
      x -= p;
    if(i >= m - 1)
        nr += verif(x);
  }
  printf("%d\n", nr);
  return 0;
}