Pagini recente » Diferente pentru teorema-chineza-a-resturilor intre reviziile 16 si 15 | Cod sursa (job #1657024) | Cod sursa (job #956006) | Cod sursa (job #74340) | Cod sursa (job #3149991)
#include <bits/stdc++.h>
using namespace std;
int main(){
string a, b;
vector<int> pos, aux;
fin >> a >> b;
aux.resize(b.size());
aux[0] = -1;
for(int i = 1, j = -1; i < aux.size(); i++){
aux[i] = -1;
if(a[i] == a[j + 1]){
j++;
aux[i] = j + 1;
}else{
while(j != -1 && a[i] != a[j + 1]){
j = aux[j];
}
if(a[i] == a[j + 1]){
j++;
aux[i] = j + 1;
}
}
}
for(int i = 0, j = -1; i < b.size(); i++){
if(b[i] == a[j + 1]){
j++;
if(j == a.size() - 1){
pos.push_back(i - j + 1);
j = aux[j];
}
}
while(j != -1 && b[i] != a[j + 1]){
j = aux[j];
}
if(b[i] == a[j + 1]){
j++;
if(j == a.size() - 1){
pos.push_back(i - j + 1);
j = aux[j];
}
}
}
return 0;
}