Cod sursa(job #2082328)
Utilizator | Jianu Mihail mihail.jianu | Data | 5 decembrie 2017 23:06:22 |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <string>
using namespace std;
int main() {
const int MAX = 1000;
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
int ans[MAX];
std::string s1, s2;
cin >> s2 >> s1;
int c = 0;
int f = -1;
int k = 0;
while(true) {
f = s1.find(s2, f + 1);
if(f == string::npos)
break;
c++;
ans[k++] = f;
}
cout << c << endl;
k = min(k, 1000);
for(int i = 0; i < k; i++)
cout << ans[i] << " ";
return 0;
}