Cod sursa(job #2563462)
| Utilizator | Data | 1 martie 2020 11:45:40 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define input "strmatch.in"
#define output "strmatch.out"
const int lMax = 2000003;
using namespace std;
string a, b;
int x, s[lMax], p, k;
main()
{
freopen(input, "rt", stdin);
freopen(output, "wt", stdout);
cin >> a >> b;
for ( ;p = b.find(a, p) + 1; s[x++]=p-1);
cout<<x<<'\n';
k = min (x, 1001);
for( ;p < k; cout << s[p++]<<' ');
return 0;
}
