Cod sursa(job #2458106)
| Utilizator | Data | 19 septembrie 2019 18:08:23 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<bits/stdc++.h>
#define NMAX 200007
using namespace std;
//FILE* in=fopen("probleme.in", "r");
//FILE* out=fopen("probleme.out", "w");
ifstream in("strmatch.in");
ofstream out("strmatch.out");
int v[NMAX], ct;
int main()
{
string A, B;
in>>A>>B;
unsigned int pos=0;
while(pos<B.length())
{
if(B.find(A, pos)==string::npos) break;
pos=B.find(A, pos);
++ct;
v[ct]=pos;
++pos;
}
out<<ct<<'\n';
for(int i=1; i<=ct; ++i)
{
out<<v[i]<<' ';
}
}
