Pagini recente » Istoria paginii runda/agm-lagheta/clasament | Istoria paginii runda/ursus_polar_de_munte/clasament | Istoria paginii runda/okfrt | Istoria paginii runda/preoji2012 | Cod sursa (job #1995630)
#include <iostream>
#include <fstream>
#include <queue>
#include <string.h>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
#define ll long long
#define pb push_back
#define ui unsigned int
const int inf = 1e9 + 5;
const int NMax = 2e6 + 5;
int N,nrSol;
int sol[NMax];
char patt[NMax],str[NMax];
int main() {
in>>patt>>str;
char *p = str;
while ( (p = strstr(p,patt)) != 0 ) {
sol[++nrSol] = p - str;
++p;
}
out<<nrSol<<'\n';
nrSol = min(1000,nrSol);
for (int i=1;i <= nrSol;++i) {
out<<sol[i]<<' ';
}
in.close();out.close();
return 0;
}