Pagini recente » Cod sursa (job #2870067) | Cod sursa (job #387302) | Cod sursa (job #429192) | Cod sursa (job #3199183) | Cod sursa (job #1931298)
#include <fstream>
#include <string>
#include <vector>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int n,m,incadrari=0,gasit;
string sir1,sir2;
vector <int> pozitii(1000);
int main()
{
f>>sir1>>sir2;
n=sir1.size();
m=sir2.size();
for(int i=0;i<=m-n;i++)
{
if(sir1[0]==sir2[i])
{
gasit=true;
for(int j=0;j<n&&gasit==true;j++)
{
if(sir1[j]!=sir2[i+j])
gasit=false;
}
if(gasit==true)
{
if(incadrari<1000)
pozitii[incadrari]=i;
incadrari++;
}
}
}
g<<incadrari<<"\n";
for(int i=0;i<incadrari&&i<1000;i++)
g<<pozitii[i]<<" ";
f.close();g.close();
}