Cod sursa(job #2554579)
| Utilizator | Data | 23 februarie 2020 10:02:42 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
vector <int> v;
char a[2000001], b[2000001];
int q;
int main()
{
f >> a;
int m = strlen(a);
f.get();
f >> b;
int n = strlen(b);
for(int i = 0; i < n; ++ i)
if(b[i] == a[0])
{
int j = i + 1;
q = 1;
while(b[j] == a[q] && q < m)
{
j ++;
q ++;
}
if(q == m) v.push_back(i);
}
g << v.size() << "\n";
for(int i = 0; i < v.size(); ++ i)
g << v[i] << " ";
return 0;
}
