Cod sursa(job #2217398)
| Utilizator | Data | 30 iunie 2018 12:30:44 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
string P, T;
int ap[1001], nrap;
int main()
{
in >> P >> T;
for(int p = T.find(P); p != string::npos; p = T.find(P, p + 1))
{
nrap++;
if(nrap <= 1000)
ap[nrap] = p;
}
out << nrap << '\n';
nrap = min(nrap, 1000);
for(int i = 1; i <= nrap; i++)
out << ap[i] << ' ';
return 0;
}
