Pagini recente » Cod sursa (job #495869) | Cod sursa (job #9085) | Cod sursa (job #1059844) | Cod sursa (job #49075) | Cod sursa (job #1053968)
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
#define length 2000001
int main() {
int i,j,nr=0,k=0,s[1001];
char a[length],b[length];
ifstream f("strmatch.in");
f>>a>>b;
f.close();
for (i=0;i<strlen(b)-strlen(a)+1;i++) {
for (j=i;j<=i+strlen(a)-1;j++) {
k = 0;
if (b[j]!=a[j-i]) {
k = 1;
break;
}
}
if (k==0) {
if (nr<1000)
s[nr] = i;
nr++;
}
}
ofstream g("strmatch.out");
g<<nr<<"\n";
if (nr>=999)
nr = 999;
for (i=0;i<nr;i++)
g<<s[i]<<" ";
g.close();
return 0;
}