Pagini recente » Cod sursa (job #1264434) | Cod sursa (job #2098651) | Istoria paginii runda/simulare.oji/clasament | Cod sursa (job #2628997) | Cod sursa (job #1536934)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
string tabel[23879];
int main()
{
ifstream in("abc2.in");
ofstream out("abc2.out");
string s, x, d;
int total = 0, c,i;
in >> s;
while (!in.eof())
{
in >> x;
c = (7919 * (x[x.size() - 1] - 'a') + 1381 * (x[1] - 'a') + x[0] - 'a') % 23879;
tabel[c] = x;
}
d = s.substr(0, x.length());
c = (7919 * (d[d.size() - 1] - 'a') + 1381 * (d[1] - 'a') + d[0] - 'a') % 23879;
if (tabel[c]==d){ total++; }
for (i = x.length(); i < s.size(); i++)
{
d.push_back(s[i]);
d.erase(d.begin());
c = (7919 * (d[d.size() - 1] - 'a') + 1381 * (d[1] - 'a') + d[0] - 'a') % 23879;
if (tabel[c] == d){ total++; }
}
out << total;
}