Cod sursa(job #2213856)
| Utilizator | Data | 17 iunie 2018 18:34:13 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 26 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <bits/stdc++.h>
using namespace std;
char s[2000005], t[2000005];
int i, j, k, v[2000005];
bool ok;
int main()
{
ifstream f("strmatch.in");
ofstream g("strmatch.out");
f.getline(s, sizeof(s));
f.getline(t, sizeof(t));
for(i = 0;i < strlen(t) - strlen(s) + 1;i++)
if(t[i] == s[0])
{
ok = true;
for(j = i + 1;j < i + strlen(s);j++)
if(t[j] != s[j - i])
{
ok = false;
break;
}
if(ok == true)v[++k] = i;
}
g << k << "\n";
for(i = 1;i <= k;i++)
g << v[i] << " ";
return 0;
}
