Cod sursa(job #2152277)
Utilizator | Data | 5 martie 2018 13:24:52 | |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <string>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int i, l, rez;
int v[1009];
string A, B;
int main(){
getline(f, A);
getline(f, B);
l = B.size();
while(B.find(A, i) >= 0 && B.find(A, i) < l){
rez++;
if (rez <= 1000)
v[rez] = B.find(A, i);
i = B.find(A, i) + 1;
}
g << rez << "\n";
for (i = 1; i <= rez; i++)
g << v[i] << " ";
return 0;
}