Pagini recente » Cod sursa (job #576851) | Cod sursa (job #1015038) | Cod sursa (job #1841880) | Cod sursa (job #1968912) | Cod sursa (job #2213228)
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
int main()
{
int n = 0,pos[1001];
string sir1,sir2;
getline(fin , sir1);
getline(fin , sir2);
if (sir1.length() > sir2.length()) fout << '0';
else
{
for (int i = 0; i <= sir2.length() -1 ; i++)
{
if (sir2.substr(i,sir1.length()) == sir1)
{
n++;
pos[n] = i;
if (n == 1000) break;
}
if (sir2.length() - 1 - i == sir1.length()) break;
}
fout << n << endl;
for (int i = 1; i <= n ; i++)
fout << pos[i] << ' ';
fin.close();fout.close();
}
return 0;
}