Cod sursa(job #3357766)
| Utilizator | Data | 13 iunie 2026 14:00:08 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
string A, B;
int cnt;
long long v[1001];
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
int main()
{
fin >> A;
fin >> B;
int i = 0;
while (B.find(A, i) <= B.size() && cnt <= 1000){
v[cnt]=B.find(A, i);
i=B.find(A,i)+1;
cnt++;
}
fout << cnt <<'\n';
for (i = 0; i < cnt; i++)
fout << v[i] <<" ";
return 0;
}
