Pagini recente » Cod sursa (job #2055453) | Cod sursa (job #2599168) | Cod sursa (job #36634) | Cod sursa (job #879866) | Cod sursa (job #2709248)
#include <fstream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <deque>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <climits>
#include <queue>
#define MOD 666013
using namespace std;
ifstream cin("strmatch.in") ;
ofstream cout("strmatch.out") ;
vector<int> v ;
int main()
{
string a, b ;
cin >> a >> b ;
char *ptr = &b[0], *auxptr ;
while(auxptr = strstr(ptr, &a[0]))
{
v.push_back(auxptr - &b[0]) ;
ptr = auxptr + 1 ;
}
cout << v.size() << endl ;
for(int f = 0 ; f < v.size() && f < 1000 ; f ++)
cout << v[f] << " " ;
return 0 ;
}