Cod sursa(job #2718294)
| Utilizator | Data | 8 martie 2021 17:26:25 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int main()
{
string a, b;
fin >> a >> b;
int nr = 0, pos[1005], p_in = 0;
int n = b.size();
int m = a.size();
for (int i = 0; i < n; i++)
{
if (p_in >= 1000) break;
int j = i;
int p = 0;
while(b[j] == a[p] && j < n && p < m)
j++, p++;
if (p == m) nr++, pos[p_in++] = i;
}
fout << nr << '\n';
for (int i = 0; i < p_in; i++) fout << pos[i] << " ";
fin.close();
fout.close();
return 0;
}
