Cod sursa(job #2214257)
| Utilizator | Data | 18 iunie 2018 17:08:28 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include <string.h>
#include <string>
#define dMAX 2000000
using namespace std;
int c;
string str1, str2;
int found;
int indexes[dMAX + 2];
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int main()
{
int i;
fin >> str1 >> str2;
found = str2.find(str1);
while (found >= 0) {
indexes[++c] = found;
found = str2.find(str1, found + 1);
}
fout << c << '\n';
for (i = 1; i <= c; i++) fout << indexes[i] << ' ';
return 0;
}
