Pagini recente » Cod sursa (job #601813) | Cod sursa (job #2200698) | Cod sursa (job #251672) | Cod sursa (job #320042) | Cod sursa (job #2637841)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int main()
{
int cnt = 0, i, poz[200];
char sir1[256], sir2[256];
fin.getline(sir1, 256);
fin.getline(sir2, 256);
int n = strlen(sir2), m = strlen(sir1);
for (i = 0; i < n; i++)
{
int ok = 1;
int k = i;
for (int j = 0; j < m; j++)
{
if (sir2[k] != sir1[j])
{
ok = 0;
break;
}
k++;
}
if (ok == 1)
{
poz[cnt] = i;
cnt++;
}
}
fout << cnt << '\n';
for (i = 0; i < cnt; i++)
fout << poz[i] << " ";
return 0;
}