Pagini recente » Cod sursa (job #1710580) | Cod sursa (job #865277) | Cod sursa (job #1220963) | Cod sursa (job #2964012) | Cod sursa (job #101235)
Cod sursa(job #101235)
#include <iostream>
#include <fstream>
using namespace std;
int const MaxT = 10000000;
int const MaxD = 50000;
int const MaxC = 20;
static int Text [1+MaxT];
static int Cuvant [1+MaxC];
class Copac {
public:
Copac() { p[0] = 0; p [1] = 0; p[2] = 0;}
~Copac() {
if (p [0]) delete p [0];
if (p [1]) delete p [1];
if (p [2]) delete p [2];
}
void Adauga(int * cuvant) {
Copac ** x = p;
Copac * y;
while (4 != (*cuvant)) {
y = x[(*cuvant)];
if(0 == y) {
y = new Copac;
x[(*cuvant)] = y;
}
x = y->p;
++ cuvant;
}
}
public:
Copac * p [3];
};
int main () {
int i, n, m, cont, j;
char ch;
ifstream sin("abc2.in");
i = 0;
while(true) {
sin . get ( ch );
Text [i] = ch;
if('\n' == Text[i]) {
Text[i] = 4;
break;
}
Text[i] -= 'a';
++ i;
}
n = i;
Copac cop;
m = 0;
i = 0;
while(true) {
sin .get (ch);
Cuvant[i] = ch;
if(! sin) break;
if('\n' == Cuvant [i]) {
Cuvant[i] = 4;
cop.Adauga(Cuvant);
if(0 == m) m = i;
i = 0;
continue;
}
Cuvant[i] -= 'a';
++ i;
}
if(0 != i) {
Cuvant[i] = 4;
cop.Adauga(Cuvant);
if(0 == m) m = i;
}
cont = 0;
if(0 != m) {
Copac ** x, * y;
int * s;
for(i = n-m; i >= 0; i --) {
x = cop.p; s = &Text [i];
for(j=0;j<m;j++) {
y = x[s[j]];
if(0 == y) break;
x = y->p;
}
if(m==j) ++ cont;
}
}
ofstream sout("abc2.out");
sout << cont << endl;
return 0;
}