Cod sursa(job #2633175)
Utilizator | Data | 6 iulie 2020 17:31:20 | |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
string A, B;
int sol[1 << 22], cnt, p;
int main () {
fin >> A >> B;
while (p = B.find (A, p) + 1)
sol[cnt ++] = p - 1;
fout << cnt << '\n';
for (int i = 0; i < cnt && i < 1000; i ++)
fout << sol[i] << ' ';
return 0;
}