Cod sursa(job #1174559)
| Utilizator | Data | 23 aprilie 2014 12:15:10 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <string.h>
using namespace std;
char a[2000003], b[2000003], i, j, n, m;
int v[2000003], nr;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int main()
{
f.getline(a, 2000003);
f.get(b, 2000003);
n=strlen(a);
m=strlen(b);
for (i=0; i<=m-n; ++i) {
short ok=1;
for (j=i; j<=i+n-1; ++j)
if (a[j-i]!=b[j])
ok=0;
if (ok)
v[++nr]=i;
}
g<<nr<<'\n';
for (i=1; i<=nr; ++i)
g<<v[i]<<' ';
return 0;
}
