Cod sursa(job #2218627)
| Utilizator | Data | 5 iulie 2018 10:54:26 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <string>
#define NMAX 2000005
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
string a,b;
int sol[NMAX];
int n = 0;
int main()
{
in >> b >> a;
int found;
found = a.find(b);
while(found >= 0)
{
sol[++n] = found;
found = a.find(b,found+1);
}
out << n << endl;
for(int i = 1 ; i <= n ; i++)
out << sol[i] << " ";
return 0;
}
