Pagini recente » Cod sursa (job #2955696) | Cod sursa (job #457818) | Cod sursa (job #1117977) | Cod sursa (job #2109122) | Cod sursa (job #2675049)
#include <fstream>
#include <deque>
#include <vector>
#include <bitset>
#include <queue>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <limits.h>
#include <cstring>
#include <cstring>
#define MOD 1234
using namespace std ;
ifstream cin ("strmatch.in") ;
ofstream cout ("strmatch.out") ;
string a, b ;
vector<int> v ;
int main()
{
cin >> a >> b ;
if(a.size() == 1)
{
int s = 0 ;
for(int f = 0 ; f < b.size() ; f ++)
if(b[f] == a[0])v.push_back(f) ;
cout << v.size() << endl ;
for(int f = 0 ; f < v.size() && f < 1000 ; f ++)
cout << v[f] - 1 << " " ;
return 0 ;
}
int s = 0 ;
char *ptr = &b[0] ;
while(strstr(ptr, &a[0]))
{
s ++ ;
ptr = strstr(ptr, &a[0]) + 1 ;
if(ptr)v.push_back(ptr - &b[0]) ;
}
cout << v.size() << endl ;
for(int f = 0 ; f < v.size() && f < 1000 ; f ++)
cout << v[f] - 1 << " " ;
return 0 ;
}