Pagini recente » Cod sursa (job #2263076) | Cod sursa (job #1478069) | Cod sursa (job #3227536) | Cod sursa (job #1377396) | Cod sursa (job #2793353)
#include <iostream>
#include <stdio.h>
using namespace std;
#define BAZA 62
#define MOD 1000007
#define MAXLENGHT 2000000
#define MAXOUT 1000
char pat[MAXLENGHT], v[MAXLENGHT];
int out[MAXOUT];///de pus pe char
int verif(int n, int st, int dr){
int i, f = 1;
i = 0;
while(( f ) && (i < n)){
if(pat[i] != v[i + st]){
f = 0;
}
i++;
}
return f;
}
int main()
{
FILE *fin, *fout;
char ch;
int i, n, hpat, hss, ind, put, cod, codaux;
ch = 0;
i = 0;
hpat = 0;
fin = fopen("strmatch.in", "r");
while((ch = fgetc(fin)) != '\n'){
pat[i] = ch;
if(('A' <= ch) && (ch <= 'Z')){
cod = ch - 'A';
}else if(('a' <= ch) && (ch <= 'z')){
cod = ch - 'a' + 26;
}else{
cod = ch - '0' + 52;
}
hpat = (BAZA * hpat + cod) % MOD;
i++;
}
n = i;
i = 0;
ch = 0;
hss = 0;
ind = 0;
put = 1;
while(((ch = fgetc(fin)) != '\n') && (ch != EOF)){
v[i] = ch;
if(('A' <= ch) && (ch <= 'Z')){
cod = ch - 'A';
}else if(('a' <= ch) && (ch <= 'z')){
cod = ch - 'a' + 26;
}else{
cod = ch - '0' + 52;
}
if(ind < MAXOUT){
if(i < n){
hss = (BAZA * hss + cod) % MOD;
if(i == (n - 1)){
if(hss == hpat){
if(verif(n, 0, i + 1)){
out[ind] = i - n + 1;
ind++;
}
}
}else{
put = (put * BAZA) % MOD;
}
}else{
if(('A' <= v[i - n]) && (v[i - n] <= 'Z')){
codaux = v[i - n] - 'A';
}else if(('a' <= v[i - n]) && (v[i - n] <= 'z')){
codaux = v[i - n] - 'a' + 26;
}else{
codaux = v[i - n] - '0' + 52;
}
hss = hss - (codaux * put) % MOD;
if(hss < 0){
hss += MOD;
}
hss = (hss * BAZA + cod) % MOD;
if(hss == hpat){
if(verif(n, i - n + 1, i + 1)){
out[ind] = i - n + 1;
ind++;
}
}
}
}
i++;
}
fclose(fin);
fout = fopen("strmatch.out", "w");
fprintf(fout, "%d\n", ind);
for(i = 0; i < ind; i++){
fprintf(fout, "%d ", out[i]);
}
fclose(fout);
return 0;
}