Pagini recente » Cod sursa (job #1119381) | Borderou de evaluare (job #1241036) | Cod sursa (job #829818) | Cod sursa (job #2329857) | Cod sursa (job #2502938)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int n, i, m, j, nr, sol[1003];
char a[2000002], b[2000002], ok;
int main(){
fin.getline(a, 2000002);
fin.getline(b, 2000002);
n = strlen(a);
m = strlen(b);
if(n > m){
fout<<0;
return 0;
}
for(i=0;i<=m-n && nr <= 1000;i++){
ok = 1;
for(j=0;j<n;j++)
if(b[i+j] != a[j]){
ok = 0;
break;
}
if(ok == 1){
sol[++nr] = i;
}
}
fout<<nr<<"\n";
for(i=1;i<=nr;i++)
fout<<sol[i]<<" ";
return 0;
}