Cod sursa(job #2070345)
Utilizator | Teo Oprescu MaxTeo | Data | 19 noiembrie 2017 14:21:53 |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
vector <int> rez;
string sir,subsir;
int sol,ult=-1;
int main()
{
f>>subsir>>sir;
int n=subsir.size();
while((ult=sir.find(subsir.c_str(),ult+1,n))!=string::npos)
{
++sol;
rez.push_back(ult);
}
g<<sol<<"\n";
for(int i=0;i<rez.size()&&i<1000;++i)
g<<rez[i]<<" ";
g<<"\n";
return 0;
}