Pagini recente » Cod sursa (job #943798) | Cod sursa (job #2400522) | Cod sursa (job #2679946) | Cod sursa (job #2868883) | Cod sursa (job #1930477)
#include <iostream>
#include <string>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
string str1, str2;
vector < int > sol;
int main(){
fin >> str1 >> str2;
size_t p;
p = str2.find(str1);
while (p != string::npos && p <= str2.size() - str1.size())
{
sol .push_back(p);
p = str2.find(str1, p + 1);
}
fout << sol.size() << "\n";
if (sol.size() <= 1000)
for (int i = 0; i < sol.size(); ++i)fout << sol[i] << " ";
else
for (int i = 0; i < 1000; ++i)fout << sol[i] << " ";
return 0