Pagini recente » Cod sursa (job #1549677) | Cod sursa (job #17075) | Cod sursa (job #2428685) | Ședință 2009-10-23 | Cod sursa (job #674212)
Cod sursa(job #674212)
#include <fstream>
#include <string>
using namespace std;
string minta,szoveg;
int i,l,k,m[1010];
int main()
{
ifstream in("strmatch.in");
ofstream out("strmatch.out");
in >> minta;
in >> szoveg;
l=0;
k=szoveg.find(minta,0);
while ((unsigned)k!=string::npos)
{
++l;
if (l<=1000) m[l]=k;
k=szoveg.find(minta,k+1);
}
out << l << "\n";
if (l>1000) l=1000;
for (i=1;i<=l;++i) out << m[i] << " ";
in.close();
out.close();
return 0;
}