Pagini recente » Cod sursa (job #2373946) | Cod sursa (job #1423680) | Cod sursa (job #1675929) | Cod sursa (job #3209192) | Cod sursa (job #1552729)
#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 d=1;
int main () {
fin>>v1>>v2;
int n=v1.size(),m=v2.size();
int b=0;
for (int i=0; i<=m; i++) {
int a=0,c=i;
while (v1[a]==v2[c]) {
a++;
c++;
}
if (a==n) {
b=b+1;
v[d]=i;
d++;
}
}
d--;
fout<<b<<"\n";
for (int i=1; i<=d; i++) {
fout<<v[i]<<" ";
}
return 0;
}