Pagini recente » Cod sursa (job #1457176) | Cod sursa (job #1457109)
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
int main(int argc, char **argv)
{
// INPUT
ifstream indata("strmatch.in");
char A[2000001], B[2000001];
indata >> B >> A;
indata.close();
// PATTERN MATCHING
vector<int> positions;
int n = strlen(A), m = strlen(B);
for (int i = 0; i + m <= n; i++) {
int q = 0;
while(q < m && A[i + q] == B[q]) {
q++;
}
if (q == m) {
positions.push_back(i);
}
}
// OUTPUT
ofstream outdata("strmatch.out");
outdata << positions.size() << "\n";
for (size_t i = 0; i < positions.size() && i < 1000; i++) {
outdata << positions[i] << " ";
}
outdata.close();
return 0;
}