Pagini recente » Cod sursa (job #2606502) | Cod sursa (job #452608) | Cod sursa (job #452482) | Cod sursa (job #452637) | Cod sursa (job #2605271)
#include <fstream>
#include <vector>
#include <string>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int main() {
int counter = 0;
string A, B;
vector<int> poz;
bool ok;
getline(fin, A);
getline(fin, B);
int len1 = A.size();
int len2 = B.size();
for (int i = 0;i <= len2 - len1;i ++) {
ok = true;
for (int k = i;k <= len1 + i - 1;k ++)
if (A[k - i] != B[k]) {
ok = false;
break;
}
if (ok) {
poz.push_back(i);
counter ++;
}
}
fout << counter << '\n';
int len = poz.size();
for (int i = 0;i < len;i ++)
fout << poz[i] << ' ';
return 0;
}