Cod sursa(job #2301513)
Utilizator | Data | 13 decembrie 2018 01:08:25 | |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#include <cstring>
#define Nmax 2000005
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
string a, b;
int p;
int n, s[1<<23];
int main()
{
f >> a >> b;
while(p=b.find(a, p)+1)
{
n++;
s[n]=p-1;
}
g << n << '\n';
for (int i = 1; i <= n; i++)
g << s[i] << " ";
return 0;
}