Cod sursa(job #2218669)
Utilizator | Runcan Alexandru Alex03 | Data | 5 iulie 2018 13:42:37 |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
/*Best searching substrings method in c++*/
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
string pattern,text;
int main ()
{
getline (fin,pattern);
getline (fin,text);
int n =0,i = text.find(pattern),position[1001];
while (n < 1000 && i >=0)
{
position[++n] = i;
i = text.find(pattern,i+1);
}
fout << n << endl;
for (int i =1;i <= n;i++)
fout << position[i] << ' ';
return 0;
}