Pagini recente » Cod sursa (job #2514412) | Cod sursa (job #1198890) | Cod sursa (job #439986) | Cod sursa (job #2632402) | Cod sursa (job #1570081)
#include <fstream>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
string v1, v2;
int const nmax=1000;
int v[nmax+1];
int main () {
fin>>v1>>v2;
int n=v1.size(),m=v2.size();
int b=1;
for (int i=0; i<m; i++) {
int a=0,c=i;
while (v1[a]==v2[c]) {
if (a<=n-1) {
a++;
c++;
}
}
if (a==n && b<=nmax) {
v[b]=i;
b=b+1;
}
}
b--;
fout<<b<<"\n";
for (int i=1; i<=b && i<=nmax; i++) {
fout<<v[i]<<" ";
}
fout<<"\n";
return 0;
}